<HTML>
<BODY BGCOLOR="white">
<PRE>
<FONT color="green">001</FONT>    /*<a name="line.1"></a>
<FONT color="green">002</FONT>     * Licensed to the Apache Software Foundation (ASF) under one or more<a name="line.2"></a>
<FONT color="green">003</FONT>     * contributor license agreements.  See the NOTICE file distributed with<a name="line.3"></a>
<FONT color="green">004</FONT>     * this work for additional information regarding copyright ownership.<a name="line.4"></a>
<FONT color="green">005</FONT>     * The ASF licenses this file to You under the Apache License, Version 2.0<a name="line.5"></a>
<FONT color="green">006</FONT>     * (the "License"); you may not use this file except in compliance with<a name="line.6"></a>
<FONT color="green">007</FONT>     * the License.  You may obtain a copy of the License at<a name="line.7"></a>
<FONT color="green">008</FONT>     *<a name="line.8"></a>
<FONT color="green">009</FONT>     *      http://www.apache.org/licenses/LICENSE-2.0<a name="line.9"></a>
<FONT color="green">010</FONT>     *<a name="line.10"></a>
<FONT color="green">011</FONT>     * Unless required by applicable law or agreed to in writing, software<a name="line.11"></a>
<FONT color="green">012</FONT>     * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.12"></a>
<FONT color="green">013</FONT>     * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.13"></a>
<FONT color="green">014</FONT>     * See the License for the specific language governing permissions and<a name="line.14"></a>
<FONT color="green">015</FONT>     * limitations under the License.<a name="line.15"></a>
<FONT color="green">016</FONT>     */<a name="line.16"></a>
<FONT color="green">017</FONT>    <a name="line.17"></a>
<FONT color="green">018</FONT>    package org.apache.commons.math3.dfp;<a name="line.18"></a>
<FONT color="green">019</FONT>    <a name="line.19"></a>
<FONT color="green">020</FONT>    import java.util.Arrays;<a name="line.20"></a>
<FONT color="green">021</FONT>    <a name="line.21"></a>
<FONT color="green">022</FONT>    import org.apache.commons.math3.FieldElement;<a name="line.22"></a>
<FONT color="green">023</FONT>    <a name="line.23"></a>
<FONT color="green">024</FONT>    /**<a name="line.24"></a>
<FONT color="green">025</FONT>     *  Decimal floating point library for Java<a name="line.25"></a>
<FONT color="green">026</FONT>     *<a name="line.26"></a>
<FONT color="green">027</FONT>     *  &lt;p&gt;Another floating point class.  This one is built using radix 10000<a name="line.27"></a>
<FONT color="green">028</FONT>     *  which is 10&lt;sup&gt;4&lt;/sup&gt;, so its almost decimal.&lt;/p&gt;<a name="line.28"></a>
<FONT color="green">029</FONT>     *<a name="line.29"></a>
<FONT color="green">030</FONT>     *  &lt;p&gt;The design goals here are:<a name="line.30"></a>
<FONT color="green">031</FONT>     *  &lt;ol&gt;<a name="line.31"></a>
<FONT color="green">032</FONT>     *    &lt;li&gt;Decimal math, or close to it&lt;/li&gt;<a name="line.32"></a>
<FONT color="green">033</FONT>     *    &lt;li&gt;Settable precision (but no mix between numbers using different settings)&lt;/li&gt;<a name="line.33"></a>
<FONT color="green">034</FONT>     *    &lt;li&gt;Portability.  Code should be kept as portable as possible.&lt;/li&gt;<a name="line.34"></a>
<FONT color="green">035</FONT>     *    &lt;li&gt;Performance&lt;/li&gt;<a name="line.35"></a>
<FONT color="green">036</FONT>     *    &lt;li&gt;Accuracy  - Results should always be +/- 1 ULP for basic<a name="line.36"></a>
<FONT color="green">037</FONT>     *         algebraic operation&lt;/li&gt;<a name="line.37"></a>
<FONT color="green">038</FONT>     *    &lt;li&gt;Comply with IEEE 854-1987 as much as possible.<a name="line.38"></a>
<FONT color="green">039</FONT>     *         (See IEEE 854-1987 notes below)&lt;/li&gt;<a name="line.39"></a>
<FONT color="green">040</FONT>     *  &lt;/ol&gt;&lt;/p&gt;<a name="line.40"></a>
<FONT color="green">041</FONT>     *<a name="line.41"></a>
<FONT color="green">042</FONT>     *  &lt;p&gt;Trade offs:<a name="line.42"></a>
<FONT color="green">043</FONT>     *  &lt;ol&gt;<a name="line.43"></a>
<FONT color="green">044</FONT>     *    &lt;li&gt;Memory foot print.  I'm using more memory than necessary to<a name="line.44"></a>
<FONT color="green">045</FONT>     *         represent numbers to get better performance.&lt;/li&gt;<a name="line.45"></a>
<FONT color="green">046</FONT>     *    &lt;li&gt;Digits are bigger, so rounding is a greater loss.  So, if you<a name="line.46"></a>
<FONT color="green">047</FONT>     *         really need 12 decimal digits, better use 4 base 10000 digits<a name="line.47"></a>
<FONT color="green">048</FONT>     *         there can be one partially filled.&lt;/li&gt;<a name="line.48"></a>
<FONT color="green">049</FONT>     *  &lt;/ol&gt;&lt;/p&gt;<a name="line.49"></a>
<FONT color="green">050</FONT>     *<a name="line.50"></a>
<FONT color="green">051</FONT>     *  &lt;p&gt;Numbers are represented  in the following form:<a name="line.51"></a>
<FONT color="green">052</FONT>     *  &lt;pre&gt;<a name="line.52"></a>
<FONT color="green">053</FONT>     *  n  =  sign &amp;times; mant &amp;times; (radix)&lt;sup&gt;exp&lt;/sup&gt;;&lt;/p&gt;<a name="line.53"></a>
<FONT color="green">054</FONT>     *  &lt;/pre&gt;<a name="line.54"></a>
<FONT color="green">055</FONT>     *  where sign is &amp;plusmn;1, mantissa represents a fractional number between<a name="line.55"></a>
<FONT color="green">056</FONT>     *  zero and one.  mant[0] is the least significant digit.<a name="line.56"></a>
<FONT color="green">057</FONT>     *  exp is in the range of -32767 to 32768&lt;/p&gt;<a name="line.57"></a>
<FONT color="green">058</FONT>     *<a name="line.58"></a>
<FONT color="green">059</FONT>     *  &lt;p&gt;IEEE 854-1987  Notes and differences&lt;/p&gt;<a name="line.59"></a>
<FONT color="green">060</FONT>     *<a name="line.60"></a>
<FONT color="green">061</FONT>     *  &lt;p&gt;IEEE 854 requires the radix to be either 2 or 10.  The radix here is<a name="line.61"></a>
<FONT color="green">062</FONT>     *  10000, so that requirement is not met, but  it is possible that a<a name="line.62"></a>
<FONT color="green">063</FONT>     *  subclassed can be made to make it behave as a radix 10<a name="line.63"></a>
<FONT color="green">064</FONT>     *  number.  It is my opinion that if it looks and behaves as a radix<a name="line.64"></a>
<FONT color="green">065</FONT>     *  10 number then it is one and that requirement would be met.&lt;/p&gt;<a name="line.65"></a>
<FONT color="green">066</FONT>     *<a name="line.66"></a>
<FONT color="green">067</FONT>     *  &lt;p&gt;The radix of 10000 was chosen because it should be faster to operate<a name="line.67"></a>
<FONT color="green">068</FONT>     *  on 4 decimal digits at once instead of one at a time.  Radix 10 behavior<a name="line.68"></a>
<FONT color="green">069</FONT>     *  can be realized by adding an additional rounding step to ensure that<a name="line.69"></a>
<FONT color="green">070</FONT>     *  the number of decimal digits represented is constant.&lt;/p&gt;<a name="line.70"></a>
<FONT color="green">071</FONT>     *<a name="line.71"></a>
<FONT color="green">072</FONT>     *  &lt;p&gt;The IEEE standard specifically leaves out internal data encoding,<a name="line.72"></a>
<FONT color="green">073</FONT>     *  so it is reasonable to conclude that such a subclass of this radix<a name="line.73"></a>
<FONT color="green">074</FONT>     *  10000 system is merely an encoding of a radix 10 system.&lt;/p&gt;<a name="line.74"></a>
<FONT color="green">075</FONT>     *<a name="line.75"></a>
<FONT color="green">076</FONT>     *  &lt;p&gt;IEEE 854 also specifies the existence of "sub-normal" numbers.  This<a name="line.76"></a>
<FONT color="green">077</FONT>     *  class does not contain any such entities.  The most significant radix<a name="line.77"></a>
<FONT color="green">078</FONT>     *  10000 digit is always non-zero.  Instead, we support "gradual underflow"<a name="line.78"></a>
<FONT color="green">079</FONT>     *  by raising the underflow flag for numbers less with exponent less than<a name="line.79"></a>
<FONT color="green">080</FONT>     *  expMin, but don't flush to zero until the exponent reaches MIN_EXP-digits.<a name="line.80"></a>
<FONT color="green">081</FONT>     *  Thus the smallest number we can represent would be:<a name="line.81"></a>
<FONT color="green">082</FONT>     *  1E(-(MIN_EXP-digits-1)*4),  eg, for digits=5, MIN_EXP=-32767, that would<a name="line.82"></a>
<FONT color="green">083</FONT>     *  be 1e-131092.&lt;/p&gt;<a name="line.83"></a>
<FONT color="green">084</FONT>     *<a name="line.84"></a>
<FONT color="green">085</FONT>     *  &lt;p&gt;IEEE 854 defines that the implied radix point lies just to the right<a name="line.85"></a>
<FONT color="green">086</FONT>     *  of the most significant digit and to the left of the remaining digits.<a name="line.86"></a>
<FONT color="green">087</FONT>     *  This implementation puts the implied radix point to the left of all<a name="line.87"></a>
<FONT color="green">088</FONT>     *  digits including the most significant one.  The most significant digit<a name="line.88"></a>
<FONT color="green">089</FONT>     *  here is the one just to the right of the radix point.  This is a fine<a name="line.89"></a>
<FONT color="green">090</FONT>     *  detail and is really only a matter of definition.  Any side effects of<a name="line.90"></a>
<FONT color="green">091</FONT>     *  this can be rendered invisible by a subclass.&lt;/p&gt;<a name="line.91"></a>
<FONT color="green">092</FONT>     * @see DfpField<a name="line.92"></a>
<FONT color="green">093</FONT>     * @version $Id: Dfp.java 1416643 2012-12-03 19:37:14Z tn $<a name="line.93"></a>
<FONT color="green">094</FONT>     * @since 2.2<a name="line.94"></a>
<FONT color="green">095</FONT>     */<a name="line.95"></a>
<FONT color="green">096</FONT>    public class Dfp implements FieldElement&lt;Dfp&gt; {<a name="line.96"></a>
<FONT color="green">097</FONT>    <a name="line.97"></a>
<FONT color="green">098</FONT>        /** The radix, or base of this system.  Set to 10000 */<a name="line.98"></a>
<FONT color="green">099</FONT>        public static final int RADIX = 10000;<a name="line.99"></a>
<FONT color="green">100</FONT>    <a name="line.100"></a>
<FONT color="green">101</FONT>        /** The minimum exponent before underflow is signaled.  Flush to zero<a name="line.101"></a>
<FONT color="green">102</FONT>         *  occurs at minExp-DIGITS */<a name="line.102"></a>
<FONT color="green">103</FONT>        public static final int MIN_EXP = -32767;<a name="line.103"></a>
<FONT color="green">104</FONT>    <a name="line.104"></a>
<FONT color="green">105</FONT>        /** The maximum exponent before overflow is signaled and results flushed<a name="line.105"></a>
<FONT color="green">106</FONT>         *  to infinity */<a name="line.106"></a>
<FONT color="green">107</FONT>        public static final int MAX_EXP =  32768;<a name="line.107"></a>
<FONT color="green">108</FONT>    <a name="line.108"></a>
<FONT color="green">109</FONT>        /** The amount under/overflows are scaled by before going to trap handler */<a name="line.109"></a>
<FONT color="green">110</FONT>        public static final int ERR_SCALE = 32760;<a name="line.110"></a>
<FONT color="green">111</FONT>    <a name="line.111"></a>
<FONT color="green">112</FONT>        /** Indicator value for normal finite numbers. */<a name="line.112"></a>
<FONT color="green">113</FONT>        public static final byte FINITE = 0;<a name="line.113"></a>
<FONT color="green">114</FONT>    <a name="line.114"></a>
<FONT color="green">115</FONT>        /** Indicator value for Infinity. */<a name="line.115"></a>
<FONT color="green">116</FONT>        public static final byte INFINITE = 1;<a name="line.116"></a>
<FONT color="green">117</FONT>    <a name="line.117"></a>
<FONT color="green">118</FONT>        /** Indicator value for signaling NaN. */<a name="line.118"></a>
<FONT color="green">119</FONT>        public static final byte SNAN = 2;<a name="line.119"></a>
<FONT color="green">120</FONT>    <a name="line.120"></a>
<FONT color="green">121</FONT>        /** Indicator value for quiet NaN. */<a name="line.121"></a>
<FONT color="green">122</FONT>        public static final byte QNAN = 3;<a name="line.122"></a>
<FONT color="green">123</FONT>    <a name="line.123"></a>
<FONT color="green">124</FONT>        /** String for NaN representation. */<a name="line.124"></a>
<FONT color="green">125</FONT>        private static final String NAN_STRING = "NaN";<a name="line.125"></a>
<FONT color="green">126</FONT>    <a name="line.126"></a>
<FONT color="green">127</FONT>        /** String for positive infinity representation. */<a name="line.127"></a>
<FONT color="green">128</FONT>        private static final String POS_INFINITY_STRING = "Infinity";<a name="line.128"></a>
<FONT color="green">129</FONT>    <a name="line.129"></a>
<FONT color="green">130</FONT>        /** String for negative infinity representation. */<a name="line.130"></a>
<FONT color="green">131</FONT>        private static final String NEG_INFINITY_STRING = "-Infinity";<a name="line.131"></a>
<FONT color="green">132</FONT>    <a name="line.132"></a>
<FONT color="green">133</FONT>        /** Name for traps triggered by addition. */<a name="line.133"></a>
<FONT color="green">134</FONT>        private static final String ADD_TRAP = "add";<a name="line.134"></a>
<FONT color="green">135</FONT>    <a name="line.135"></a>
<FONT color="green">136</FONT>        /** Name for traps triggered by multiplication. */<a name="line.136"></a>
<FONT color="green">137</FONT>        private static final String MULTIPLY_TRAP = "multiply";<a name="line.137"></a>
<FONT color="green">138</FONT>    <a name="line.138"></a>
<FONT color="green">139</FONT>        /** Name for traps triggered by division. */<a name="line.139"></a>
<FONT color="green">140</FONT>        private static final String DIVIDE_TRAP = "divide";<a name="line.140"></a>
<FONT color="green">141</FONT>    <a name="line.141"></a>
<FONT color="green">142</FONT>        /** Name for traps triggered by square root. */<a name="line.142"></a>
<FONT color="green">143</FONT>        private static final String SQRT_TRAP = "sqrt";<a name="line.143"></a>
<FONT color="green">144</FONT>    <a name="line.144"></a>
<FONT color="green">145</FONT>        /** Name for traps triggered by alignment. */<a name="line.145"></a>
<FONT color="green">146</FONT>        private static final String ALIGN_TRAP = "align";<a name="line.146"></a>
<FONT color="green">147</FONT>    <a name="line.147"></a>
<FONT color="green">148</FONT>        /** Name for traps triggered by truncation. */<a name="line.148"></a>
<FONT color="green">149</FONT>        private static final String TRUNC_TRAP = "trunc";<a name="line.149"></a>
<FONT color="green">150</FONT>    <a name="line.150"></a>
<FONT color="green">151</FONT>        /** Name for traps triggered by nextAfter. */<a name="line.151"></a>
<FONT color="green">152</FONT>        private static final String NEXT_AFTER_TRAP = "nextAfter";<a name="line.152"></a>
<FONT color="green">153</FONT>    <a name="line.153"></a>
<FONT color="green">154</FONT>        /** Name for traps triggered by lessThan. */<a name="line.154"></a>
<FONT color="green">155</FONT>        private static final String LESS_THAN_TRAP = "lessThan";<a name="line.155"></a>
<FONT color="green">156</FONT>    <a name="line.156"></a>
<FONT color="green">157</FONT>        /** Name for traps triggered by greaterThan. */<a name="line.157"></a>
<FONT color="green">158</FONT>        private static final String GREATER_THAN_TRAP = "greaterThan";<a name="line.158"></a>
<FONT color="green">159</FONT>    <a name="line.159"></a>
<FONT color="green">160</FONT>        /** Name for traps triggered by newInstance. */<a name="line.160"></a>
<FONT color="green">161</FONT>        private static final String NEW_INSTANCE_TRAP = "newInstance";<a name="line.161"></a>
<FONT color="green">162</FONT>    <a name="line.162"></a>
<FONT color="green">163</FONT>        /** Mantissa. */<a name="line.163"></a>
<FONT color="green">164</FONT>        protected int[] mant;<a name="line.164"></a>
<FONT color="green">165</FONT>    <a name="line.165"></a>
<FONT color="green">166</FONT>        /** Sign bit: 1 for positive, -1 for negative. */<a name="line.166"></a>
<FONT color="green">167</FONT>        protected byte sign;<a name="line.167"></a>
<FONT color="green">168</FONT>    <a name="line.168"></a>
<FONT color="green">169</FONT>        /** Exponent. */<a name="line.169"></a>
<FONT color="green">170</FONT>        protected int exp;<a name="line.170"></a>
<FONT color="green">171</FONT>    <a name="line.171"></a>
<FONT color="green">172</FONT>        /** Indicator for non-finite / non-number values. */<a name="line.172"></a>
<FONT color="green">173</FONT>        protected byte nans;<a name="line.173"></a>
<FONT color="green">174</FONT>    <a name="line.174"></a>
<FONT color="green">175</FONT>        /** Factory building similar Dfp's. */<a name="line.175"></a>
<FONT color="green">176</FONT>        private final DfpField field;<a name="line.176"></a>
<FONT color="green">177</FONT>    <a name="line.177"></a>
<FONT color="green">178</FONT>        /** Makes an instance with a value of zero.<a name="line.178"></a>
<FONT color="green">179</FONT>         * @param field field to which this instance belongs<a name="line.179"></a>
<FONT color="green">180</FONT>         */<a name="line.180"></a>
<FONT color="green">181</FONT>        protected Dfp(final DfpField field) {<a name="line.181"></a>
<FONT color="green">182</FONT>            mant = new int[field.getRadixDigits()];<a name="line.182"></a>
<FONT color="green">183</FONT>            sign = 1;<a name="line.183"></a>
<FONT color="green">184</FONT>            exp = 0;<a name="line.184"></a>
<FONT color="green">185</FONT>            nans = FINITE;<a name="line.185"></a>
<FONT color="green">186</FONT>            this.field = field;<a name="line.186"></a>
<FONT color="green">187</FONT>        }<a name="line.187"></a>
<FONT color="green">188</FONT>    <a name="line.188"></a>
<FONT color="green">189</FONT>        /** Create an instance from a byte value.<a name="line.189"></a>
<FONT color="green">190</FONT>         * @param field field to which this instance belongs<a name="line.190"></a>
<FONT color="green">191</FONT>         * @param x value to convert to an instance<a name="line.191"></a>
<FONT color="green">192</FONT>         */<a name="line.192"></a>
<FONT color="green">193</FONT>        protected Dfp(final DfpField field, byte x) {<a name="line.193"></a>
<FONT color="green">194</FONT>            this(field, (long) x);<a name="line.194"></a>
<FONT color="green">195</FONT>        }<a name="line.195"></a>
<FONT color="green">196</FONT>    <a name="line.196"></a>
<FONT color="green">197</FONT>        /** Create an instance from an int value.<a name="line.197"></a>
<FONT color="green">198</FONT>         * @param field field to which this instance belongs<a name="line.198"></a>
<FONT color="green">199</FONT>         * @param x value to convert to an instance<a name="line.199"></a>
<FONT color="green">200</FONT>         */<a name="line.200"></a>
<FONT color="green">201</FONT>        protected Dfp(final DfpField field, int x) {<a name="line.201"></a>
<FONT color="green">202</FONT>            this(field, (long) x);<a name="line.202"></a>
<FONT color="green">203</FONT>        }<a name="line.203"></a>
<FONT color="green">204</FONT>    <a name="line.204"></a>
<FONT color="green">205</FONT>        /** Create an instance from a long value.<a name="line.205"></a>
<FONT color="green">206</FONT>         * @param field field to which this instance belongs<a name="line.206"></a>
<FONT color="green">207</FONT>         * @param x value to convert to an instance<a name="line.207"></a>
<FONT color="green">208</FONT>         */<a name="line.208"></a>
<FONT color="green">209</FONT>        protected Dfp(final DfpField field, long x) {<a name="line.209"></a>
<FONT color="green">210</FONT>    <a name="line.210"></a>
<FONT color="green">211</FONT>            // initialize as if 0<a name="line.211"></a>
<FONT color="green">212</FONT>            mant = new int[field.getRadixDigits()];<a name="line.212"></a>
<FONT color="green">213</FONT>            nans = FINITE;<a name="line.213"></a>
<FONT color="green">214</FONT>            this.field = field;<a name="line.214"></a>
<FONT color="green">215</FONT>    <a name="line.215"></a>
<FONT color="green">216</FONT>            boolean isLongMin = false;<a name="line.216"></a>
<FONT color="green">217</FONT>            if (x == Long.MIN_VALUE) {<a name="line.217"></a>
<FONT color="green">218</FONT>                // special case for Long.MIN_VALUE (-9223372036854775808)<a name="line.218"></a>
<FONT color="green">219</FONT>                // we must shift it before taking its absolute value<a name="line.219"></a>
<FONT color="green">220</FONT>                isLongMin = true;<a name="line.220"></a>
<FONT color="green">221</FONT>                ++x;<a name="line.221"></a>
<FONT color="green">222</FONT>            }<a name="line.222"></a>
<FONT color="green">223</FONT>    <a name="line.223"></a>
<FONT color="green">224</FONT>            // set the sign<a name="line.224"></a>
<FONT color="green">225</FONT>            if (x &lt; 0) {<a name="line.225"></a>
<FONT color="green">226</FONT>                sign = -1;<a name="line.226"></a>
<FONT color="green">227</FONT>                x = -x;<a name="line.227"></a>
<FONT color="green">228</FONT>            } else {<a name="line.228"></a>
<FONT color="green">229</FONT>                sign = 1;<a name="line.229"></a>
<FONT color="green">230</FONT>            }<a name="line.230"></a>
<FONT color="green">231</FONT>    <a name="line.231"></a>
<FONT color="green">232</FONT>            exp = 0;<a name="line.232"></a>
<FONT color="green">233</FONT>            while (x != 0) {<a name="line.233"></a>
<FONT color="green">234</FONT>                System.arraycopy(mant, mant.length - exp, mant, mant.length - 1 - exp, exp);<a name="line.234"></a>
<FONT color="green">235</FONT>                mant[mant.length - 1] = (int) (x % RADIX);<a name="line.235"></a>
<FONT color="green">236</FONT>                x /= RADIX;<a name="line.236"></a>
<FONT color="green">237</FONT>                exp++;<a name="line.237"></a>
<FONT color="green">238</FONT>            }<a name="line.238"></a>
<FONT color="green">239</FONT>    <a name="line.239"></a>
<FONT color="green">240</FONT>            if (isLongMin) {<a name="line.240"></a>
<FONT color="green">241</FONT>                // remove the shift added for Long.MIN_VALUE<a name="line.241"></a>
<FONT color="green">242</FONT>                // we know in this case that fixing the last digit is sufficient<a name="line.242"></a>
<FONT color="green">243</FONT>                for (int i = 0; i &lt; mant.length - 1; i++) {<a name="line.243"></a>
<FONT color="green">244</FONT>                    if (mant[i] != 0) {<a name="line.244"></a>
<FONT color="green">245</FONT>                        mant[i]++;<a name="line.245"></a>
<FONT color="green">246</FONT>                        break;<a name="line.246"></a>
<FONT color="green">247</FONT>                    }<a name="line.247"></a>
<FONT color="green">248</FONT>                }<a name="line.248"></a>
<FONT color="green">249</FONT>            }<a name="line.249"></a>
<FONT color="green">250</FONT>        }<a name="line.250"></a>
<FONT color="green">251</FONT>    <a name="line.251"></a>
<FONT color="green">252</FONT>        /** Create an instance from a double value.<a name="line.252"></a>
<FONT color="green">253</FONT>         * @param field field to which this instance belongs<a name="line.253"></a>
<FONT color="green">254</FONT>         * @param x value to convert to an instance<a name="line.254"></a>
<FONT color="green">255</FONT>         */<a name="line.255"></a>
<FONT color="green">256</FONT>        protected Dfp(final DfpField field, double x) {<a name="line.256"></a>
<FONT color="green">257</FONT>    <a name="line.257"></a>
<FONT color="green">258</FONT>            // initialize as if 0<a name="line.258"></a>
<FONT color="green">259</FONT>            mant = new int[field.getRadixDigits()];<a name="line.259"></a>
<FONT color="green">260</FONT>            sign = 1;<a name="line.260"></a>
<FONT color="green">261</FONT>            exp = 0;<a name="line.261"></a>
<FONT color="green">262</FONT>            nans = FINITE;<a name="line.262"></a>
<FONT color="green">263</FONT>            this.field = field;<a name="line.263"></a>
<FONT color="green">264</FONT>    <a name="line.264"></a>
<FONT color="green">265</FONT>            long bits = Double.doubleToLongBits(x);<a name="line.265"></a>
<FONT color="green">266</FONT>            long mantissa = bits &amp; 0x000fffffffffffffL;<a name="line.266"></a>
<FONT color="green">267</FONT>            int exponent = (int) ((bits &amp; 0x7ff0000000000000L) &gt;&gt; 52) - 1023;<a name="line.267"></a>
<FONT color="green">268</FONT>    <a name="line.268"></a>
<FONT color="green">269</FONT>            if (exponent == -1023) {<a name="line.269"></a>
<FONT color="green">270</FONT>                // Zero or sub-normal<a name="line.270"></a>
<FONT color="green">271</FONT>                if (x == 0) {<a name="line.271"></a>
<FONT color="green">272</FONT>                    // make sure 0 has the right sign<a name="line.272"></a>
<FONT color="green">273</FONT>                    if ((bits &amp; 0x8000000000000000L) != 0) {<a name="line.273"></a>
<FONT color="green">274</FONT>                        sign = -1;<a name="line.274"></a>
<FONT color="green">275</FONT>                    }<a name="line.275"></a>
<FONT color="green">276</FONT>                    return;<a name="line.276"></a>
<FONT color="green">277</FONT>                }<a name="line.277"></a>
<FONT color="green">278</FONT>    <a name="line.278"></a>
<FONT color="green">279</FONT>                exponent++;<a name="line.279"></a>
<FONT color="green">280</FONT>    <a name="line.280"></a>
<FONT color="green">281</FONT>                // Normalize the subnormal number<a name="line.281"></a>
<FONT color="green">282</FONT>                while ( (mantissa &amp; 0x0010000000000000L) == 0) {<a name="line.282"></a>
<FONT color="green">283</FONT>                    exponent--;<a name="line.283"></a>
<FONT color="green">284</FONT>                    mantissa &lt;&lt;= 1;<a name="line.284"></a>
<FONT color="green">285</FONT>                }<a name="line.285"></a>
<FONT color="green">286</FONT>                mantissa &amp;= 0x000fffffffffffffL;<a name="line.286"></a>
<FONT color="green">287</FONT>            }<a name="line.287"></a>
<FONT color="green">288</FONT>    <a name="line.288"></a>
<FONT color="green">289</FONT>            if (exponent == 1024) {<a name="line.289"></a>
<FONT color="green">290</FONT>                // infinity or NAN<a name="line.290"></a>
<FONT color="green">291</FONT>                if (x != x) {<a name="line.291"></a>
<FONT color="green">292</FONT>                    sign = (byte) 1;<a name="line.292"></a>
<FONT color="green">293</FONT>                    nans = QNAN;<a name="line.293"></a>
<FONT color="green">294</FONT>                } else if (x &lt; 0) {<a name="line.294"></a>
<FONT color="green">295</FONT>                    sign = (byte) -1;<a name="line.295"></a>
<FONT color="green">296</FONT>                    nans = INFINITE;<a name="line.296"></a>
<FONT color="green">297</FONT>                } else {<a name="line.297"></a>
<FONT color="green">298</FONT>                    sign = (byte) 1;<a name="line.298"></a>
<FONT color="green">299</FONT>                    nans = INFINITE;<a name="line.299"></a>
<FONT color="green">300</FONT>                }<a name="line.300"></a>
<FONT color="green">301</FONT>                return;<a name="line.301"></a>
<FONT color="green">302</FONT>            }<a name="line.302"></a>
<FONT color="green">303</FONT>    <a name="line.303"></a>
<FONT color="green">304</FONT>            Dfp xdfp = new Dfp(field, mantissa);<a name="line.304"></a>
<FONT color="green">305</FONT>            xdfp = xdfp.divide(new Dfp(field, 4503599627370496l)).add(field.getOne());  // Divide by 2^52, then add one<a name="line.305"></a>
<FONT color="green">306</FONT>            xdfp = xdfp.multiply(DfpMath.pow(field.getTwo(), exponent));<a name="line.306"></a>
<FONT color="green">307</FONT>    <a name="line.307"></a>
<FONT color="green">308</FONT>            if ((bits &amp; 0x8000000000000000L) != 0) {<a name="line.308"></a>
<FONT color="green">309</FONT>                xdfp = xdfp.negate();<a name="line.309"></a>
<FONT color="green">310</FONT>            }<a name="line.310"></a>
<FONT color="green">311</FONT>    <a name="line.311"></a>
<FONT color="green">312</FONT>            System.arraycopy(xdfp.mant, 0, mant, 0, mant.length);<a name="line.312"></a>
<FONT color="green">313</FONT>            sign = xdfp.sign;<a name="line.313"></a>
<FONT color="green">314</FONT>            exp  = xdfp.exp;<a name="line.314"></a>
<FONT color="green">315</FONT>            nans = xdfp.nans;<a name="line.315"></a>
<FONT color="green">316</FONT>    <a name="line.316"></a>
<FONT color="green">317</FONT>        }<a name="line.317"></a>
<FONT color="green">318</FONT>    <a name="line.318"></a>
<FONT color="green">319</FONT>        /** Copy constructor.<a name="line.319"></a>
<FONT color="green">320</FONT>         * @param d instance to copy<a name="line.320"></a>
<FONT color="green">321</FONT>         */<a name="line.321"></a>
<FONT color="green">322</FONT>        public Dfp(final Dfp d) {<a name="line.322"></a>
<FONT color="green">323</FONT>            mant  = d.mant.clone();<a name="line.323"></a>
<FONT color="green">324</FONT>            sign  = d.sign;<a name="line.324"></a>
<FONT color="green">325</FONT>            exp   = d.exp;<a name="line.325"></a>
<FONT color="green">326</FONT>            nans  = d.nans;<a name="line.326"></a>
<FONT color="green">327</FONT>            field = d.field;<a name="line.327"></a>
<FONT color="green">328</FONT>        }<a name="line.328"></a>
<FONT color="green">329</FONT>    <a name="line.329"></a>
<FONT color="green">330</FONT>        /** Create an instance from a String representation.<a name="line.330"></a>
<FONT color="green">331</FONT>         * @param field field to which this instance belongs<a name="line.331"></a>
<FONT color="green">332</FONT>         * @param s string representation of the instance<a name="line.332"></a>
<FONT color="green">333</FONT>         */<a name="line.333"></a>
<FONT color="green">334</FONT>        protected Dfp(final DfpField field, final String s) {<a name="line.334"></a>
<FONT color="green">335</FONT>    <a name="line.335"></a>
<FONT color="green">336</FONT>            // initialize as if 0<a name="line.336"></a>
<FONT color="green">337</FONT>            mant = new int[field.getRadixDigits()];<a name="line.337"></a>
<FONT color="green">338</FONT>            sign = 1;<a name="line.338"></a>
<FONT color="green">339</FONT>            exp = 0;<a name="line.339"></a>
<FONT color="green">340</FONT>            nans = FINITE;<a name="line.340"></a>
<FONT color="green">341</FONT>            this.field = field;<a name="line.341"></a>
<FONT color="green">342</FONT>    <a name="line.342"></a>
<FONT color="green">343</FONT>            boolean decimalFound = false;<a name="line.343"></a>
<FONT color="green">344</FONT>            final int rsize = 4;   // size of radix in decimal digits<a name="line.344"></a>
<FONT color="green">345</FONT>            final int offset = 4;  // Starting offset into Striped<a name="line.345"></a>
<FONT color="green">346</FONT>            final char[] striped = new char[getRadixDigits() * rsize + offset * 2];<a name="line.346"></a>
<FONT color="green">347</FONT>    <a name="line.347"></a>
<FONT color="green">348</FONT>            // Check some special cases<a name="line.348"></a>
<FONT color="green">349</FONT>            if (s.equals(POS_INFINITY_STRING)) {<a name="line.349"></a>
<FONT color="green">350</FONT>                sign = (byte) 1;<a name="line.350"></a>
<FONT color="green">351</FONT>                nans = INFINITE;<a name="line.351"></a>
<FONT color="green">352</FONT>                return;<a name="line.352"></a>
<FONT color="green">353</FONT>            }<a name="line.353"></a>
<FONT color="green">354</FONT>    <a name="line.354"></a>
<FONT color="green">355</FONT>            if (s.equals(NEG_INFINITY_STRING)) {<a name="line.355"></a>
<FONT color="green">356</FONT>                sign = (byte) -1;<a name="line.356"></a>
<FONT color="green">357</FONT>                nans = INFINITE;<a name="line.357"></a>
<FONT color="green">358</FONT>                return;<a name="line.358"></a>
<FONT color="green">359</FONT>            }<a name="line.359"></a>
<FONT color="green">360</FONT>    <a name="line.360"></a>
<FONT color="green">361</FONT>            if (s.equals(NAN_STRING)) {<a name="line.361"></a>
<FONT color="green">362</FONT>                sign = (byte) 1;<a name="line.362"></a>
<FONT color="green">363</FONT>                nans = QNAN;<a name="line.363"></a>
<FONT color="green">364</FONT>                return;<a name="line.364"></a>
<FONT color="green">365</FONT>            }<a name="line.365"></a>
<FONT color="green">366</FONT>    <a name="line.366"></a>
<FONT color="green">367</FONT>            // Check for scientific notation<a name="line.367"></a>
<FONT color="green">368</FONT>            int p = s.indexOf("e");<a name="line.368"></a>
<FONT color="green">369</FONT>            if (p == -1) { // try upper case?<a name="line.369"></a>
<FONT color="green">370</FONT>                p = s.indexOf("E");<a name="line.370"></a>
<FONT color="green">371</FONT>            }<a name="line.371"></a>
<FONT color="green">372</FONT>    <a name="line.372"></a>
<FONT color="green">373</FONT>            final String fpdecimal;<a name="line.373"></a>
<FONT color="green">374</FONT>            int sciexp = 0;<a name="line.374"></a>
<FONT color="green">375</FONT>            if (p != -1) {<a name="line.375"></a>
<FONT color="green">376</FONT>                // scientific notation<a name="line.376"></a>
<FONT color="green">377</FONT>                fpdecimal = s.substring(0, p);<a name="line.377"></a>
<FONT color="green">378</FONT>                String fpexp = s.substring(p+1);<a name="line.378"></a>
<FONT color="green">379</FONT>                boolean negative = false;<a name="line.379"></a>
<FONT color="green">380</FONT>    <a name="line.380"></a>
<FONT color="green">381</FONT>                for (int i=0; i&lt;fpexp.length(); i++)<a name="line.381"></a>
<FONT color="green">382</FONT>                {<a name="line.382"></a>
<FONT color="green">383</FONT>                    if (fpexp.charAt(i) == '-')<a name="line.383"></a>
<FONT color="green">384</FONT>                    {<a name="line.384"></a>
<FONT color="green">385</FONT>                        negative = true;<a name="line.385"></a>
<FONT color="green">386</FONT>                        continue;<a name="line.386"></a>
<FONT color="green">387</FONT>                    }<a name="line.387"></a>
<FONT color="green">388</FONT>                    if (fpexp.charAt(i) &gt;= '0' &amp;&amp; fpexp.charAt(i) &lt;= '9') {<a name="line.388"></a>
<FONT color="green">389</FONT>                        sciexp = sciexp * 10 + fpexp.charAt(i) - '0';<a name="line.389"></a>
<FONT color="green">390</FONT>                    }<a name="line.390"></a>
<FONT color="green">391</FONT>                }<a name="line.391"></a>
<FONT color="green">392</FONT>    <a name="line.392"></a>
<FONT color="green">393</FONT>                if (negative) {<a name="line.393"></a>
<FONT color="green">394</FONT>                    sciexp = -sciexp;<a name="line.394"></a>
<FONT color="green">395</FONT>                }<a name="line.395"></a>
<FONT color="green">396</FONT>            } else {<a name="line.396"></a>
<FONT color="green">397</FONT>                // normal case<a name="line.397"></a>
<FONT color="green">398</FONT>                fpdecimal = s;<a name="line.398"></a>
<FONT color="green">399</FONT>            }<a name="line.399"></a>
<FONT color="green">400</FONT>    <a name="line.400"></a>
<FONT color="green">401</FONT>            // If there is a minus sign in the number then it is negative<a name="line.401"></a>
<FONT color="green">402</FONT>            if (fpdecimal.indexOf("-") !=  -1) {<a name="line.402"></a>
<FONT color="green">403</FONT>                sign = -1;<a name="line.403"></a>
<FONT color="green">404</FONT>            }<a name="line.404"></a>
<FONT color="green">405</FONT>    <a name="line.405"></a>
<FONT color="green">406</FONT>            // First off, find all of the leading zeros, trailing zeros, and significant digits<a name="line.406"></a>
<FONT color="green">407</FONT>            p = 0;<a name="line.407"></a>
<FONT color="green">408</FONT>    <a name="line.408"></a>
<FONT color="green">409</FONT>            // Move p to first significant digit<a name="line.409"></a>
<FONT color="green">410</FONT>            int decimalPos = 0;<a name="line.410"></a>
<FONT color="green">411</FONT>            for (;;) {<a name="line.411"></a>
<FONT color="green">412</FONT>                if (fpdecimal.charAt(p) &gt;= '1' &amp;&amp; fpdecimal.charAt(p) &lt;= '9') {<a name="line.412"></a>
<FONT color="green">413</FONT>                    break;<a name="line.413"></a>
<FONT color="green">414</FONT>                }<a name="line.414"></a>
<FONT color="green">415</FONT>    <a name="line.415"></a>
<FONT color="green">416</FONT>                if (decimalFound &amp;&amp; fpdecimal.charAt(p) == '0') {<a name="line.416"></a>
<FONT color="green">417</FONT>                    decimalPos--;<a name="line.417"></a>
<FONT color="green">418</FONT>                }<a name="line.418"></a>
<FONT color="green">419</FONT>    <a name="line.419"></a>
<FONT color="green">420</FONT>                if (fpdecimal.charAt(p) == '.') {<a name="line.420"></a>
<FONT color="green">421</FONT>                    decimalFound = true;<a name="line.421"></a>
<FONT color="green">422</FONT>                }<a name="line.422"></a>
<FONT color="green">423</FONT>    <a name="line.423"></a>
<FONT color="green">424</FONT>                p++;<a name="line.424"></a>
<FONT color="green">425</FONT>    <a name="line.425"></a>
<FONT color="green">426</FONT>                if (p == fpdecimal.length()) {<a name="line.426"></a>
<FONT color="green">427</FONT>                    break;<a name="line.427"></a>
<FONT color="green">428</FONT>                }<a name="line.428"></a>
<FONT color="green">429</FONT>            }<a name="line.429"></a>
<FONT color="green">430</FONT>    <a name="line.430"></a>
<FONT color="green">431</FONT>            // Copy the string onto Stripped<a name="line.431"></a>
<FONT color="green">432</FONT>            int q = offset;<a name="line.432"></a>
<FONT color="green">433</FONT>            striped[0] = '0';<a name="line.433"></a>
<FONT color="green">434</FONT>            striped[1] = '0';<a name="line.434"></a>
<FONT color="green">435</FONT>            striped[2] = '0';<a name="line.435"></a>
<FONT color="green">436</FONT>            striped[3] = '0';<a name="line.436"></a>
<FONT color="green">437</FONT>            int significantDigits=0;<a name="line.437"></a>
<FONT color="green">438</FONT>            for(;;) {<a name="line.438"></a>
<FONT color="green">439</FONT>                if (p == (fpdecimal.length())) {<a name="line.439"></a>
<FONT color="green">440</FONT>                    break;<a name="line.440"></a>
<FONT color="green">441</FONT>                }<a name="line.441"></a>
<FONT color="green">442</FONT>    <a name="line.442"></a>
<FONT color="green">443</FONT>                // Don't want to run pass the end of the array<a name="line.443"></a>
<FONT color="green">444</FONT>                if (q == mant.length*rsize+offset+1) {<a name="line.444"></a>
<FONT color="green">445</FONT>                    break;<a name="line.445"></a>
<FONT color="green">446</FONT>                }<a name="line.446"></a>
<FONT color="green">447</FONT>    <a name="line.447"></a>
<FONT color="green">448</FONT>                if (fpdecimal.charAt(p) == '.') {<a name="line.448"></a>
<FONT color="green">449</FONT>                    decimalFound = true;<a name="line.449"></a>
<FONT color="green">450</FONT>                    decimalPos = significantDigits;<a name="line.450"></a>
<FONT color="green">451</FONT>                    p++;<a name="line.451"></a>
<FONT color="green">452</FONT>                    continue;<a name="line.452"></a>
<FONT color="green">453</FONT>                }<a name="line.453"></a>
<FONT color="green">454</FONT>    <a name="line.454"></a>
<FONT color="green">455</FONT>                if (fpdecimal.charAt(p) &lt; '0' || fpdecimal.charAt(p) &gt; '9') {<a name="line.455"></a>
<FONT color="green">456</FONT>                    p++;<a name="line.456"></a>
<FONT color="green">457</FONT>                    continue;<a name="line.457"></a>
<FONT color="green">458</FONT>                }<a name="line.458"></a>
<FONT color="green">459</FONT>    <a name="line.459"></a>
<FONT color="green">460</FONT>                striped[q] = fpdecimal.charAt(p);<a name="line.460"></a>
<FONT color="green">461</FONT>                q++;<a name="line.461"></a>
<FONT color="green">462</FONT>                p++;<a name="line.462"></a>
<FONT color="green">463</FONT>                significantDigits++;<a name="line.463"></a>
<FONT color="green">464</FONT>            }<a name="line.464"></a>
<FONT color="green">465</FONT>    <a name="line.465"></a>
<FONT color="green">466</FONT>    <a name="line.466"></a>
<FONT color="green">467</FONT>            // If the decimal point has been found then get rid of trailing zeros.<a name="line.467"></a>
<FONT color="green">468</FONT>            if (decimalFound &amp;&amp; q != offset) {<a name="line.468"></a>
<FONT color="green">469</FONT>                for (;;) {<a name="line.469"></a>
<FONT color="green">470</FONT>                    q--;<a name="line.470"></a>
<FONT color="green">471</FONT>                    if (q == offset) {<a name="line.471"></a>
<FONT color="green">472</FONT>                        break;<a name="line.472"></a>
<FONT color="green">473</FONT>                    }<a name="line.473"></a>
<FONT color="green">474</FONT>                    if (striped[q] == '0') {<a name="line.474"></a>
<FONT color="green">475</FONT>                        significantDigits--;<a name="line.475"></a>
<FONT color="green">476</FONT>                    } else {<a name="line.476"></a>
<FONT color="green">477</FONT>                        break;<a name="line.477"></a>
<FONT color="green">478</FONT>                    }<a name="line.478"></a>
<FONT color="green">479</FONT>                }<a name="line.479"></a>
<FONT color="green">480</FONT>            }<a name="line.480"></a>
<FONT color="green">481</FONT>    <a name="line.481"></a>
<FONT color="green">482</FONT>            // special case of numbers like "0.00000"<a name="line.482"></a>
<FONT color="green">483</FONT>            if (decimalFound &amp;&amp; significantDigits == 0) {<a name="line.483"></a>
<FONT color="green">484</FONT>                decimalPos = 0;<a name="line.484"></a>
<FONT color="green">485</FONT>            }<a name="line.485"></a>
<FONT color="green">486</FONT>    <a name="line.486"></a>
<FONT color="green">487</FONT>            // Implicit decimal point at end of number if not present<a name="line.487"></a>
<FONT color="green">488</FONT>            if (!decimalFound) {<a name="line.488"></a>
<FONT color="green">489</FONT>                decimalPos = q-offset;<a name="line.489"></a>
<FONT color="green">490</FONT>            }<a name="line.490"></a>
<FONT color="green">491</FONT>    <a name="line.491"></a>
<FONT color="green">492</FONT>            // Find the number of significant trailing zeros<a name="line.492"></a>
<FONT color="green">493</FONT>            q = offset;  // set q to point to first sig digit<a name="line.493"></a>
<FONT color="green">494</FONT>            p = significantDigits-1+offset;<a name="line.494"></a>
<FONT color="green">495</FONT>    <a name="line.495"></a>
<FONT color="green">496</FONT>            while (p &gt; q) {<a name="line.496"></a>
<FONT color="green">497</FONT>                if (striped[p] != '0') {<a name="line.497"></a>
<FONT color="green">498</FONT>                    break;<a name="line.498"></a>
<FONT color="green">499</FONT>                }<a name="line.499"></a>
<FONT color="green">500</FONT>                p--;<a name="line.500"></a>
<FONT color="green">501</FONT>            }<a name="line.501"></a>
<FONT color="green">502</FONT>    <a name="line.502"></a>
<FONT color="green">503</FONT>            // Make sure the decimal is on a mod 10000 boundary<a name="line.503"></a>
<FONT color="green">504</FONT>            int i = ((rsize * 100) - decimalPos - sciexp % rsize) % rsize;<a name="line.504"></a>
<FONT color="green">505</FONT>            q -= i;<a name="line.505"></a>
<FONT color="green">506</FONT>            decimalPos += i;<a name="line.506"></a>
<FONT color="green">507</FONT>    <a name="line.507"></a>
<FONT color="green">508</FONT>            // Make the mantissa length right by adding zeros at the end if necessary<a name="line.508"></a>
<FONT color="green">509</FONT>            while ((p - q) &lt; (mant.length * rsize)) {<a name="line.509"></a>
<FONT color="green">510</FONT>                for (i = 0; i &lt; rsize; i++) {<a name="line.510"></a>
<FONT color="green">511</FONT>                    striped[++p] = '0';<a name="line.511"></a>
<FONT color="green">512</FONT>                }<a name="line.512"></a>
<FONT color="green">513</FONT>            }<a name="line.513"></a>
<FONT color="green">514</FONT>    <a name="line.514"></a>
<FONT color="green">515</FONT>            // Ok, now we know how many trailing zeros there are,<a name="line.515"></a>
<FONT color="green">516</FONT>            // and where the least significant digit is<a name="line.516"></a>
<FONT color="green">517</FONT>            for (i = mant.length - 1; i &gt;= 0; i--) {<a name="line.517"></a>
<FONT color="green">518</FONT>                mant[i] = (striped[q]   - '0') * 1000 +<a name="line.518"></a>
<FONT color="green">519</FONT>                          (striped[q+1] - '0') * 100  +<a name="line.519"></a>
<FONT color="green">520</FONT>                          (striped[q+2] - '0') * 10   +<a name="line.520"></a>
<FONT color="green">521</FONT>                          (striped[q+3] - '0');<a name="line.521"></a>
<FONT color="green">522</FONT>                q += 4;<a name="line.522"></a>
<FONT color="green">523</FONT>            }<a name="line.523"></a>
<FONT color="green">524</FONT>    <a name="line.524"></a>
<FONT color="green">525</FONT>    <a name="line.525"></a>
<FONT color="green">526</FONT>            exp = (decimalPos+sciexp) / rsize;<a name="line.526"></a>
<FONT color="green">527</FONT>    <a name="line.527"></a>
<FONT color="green">528</FONT>            if (q &lt; striped.length) {<a name="line.528"></a>
<FONT color="green">529</FONT>                // Is there possible another digit?<a name="line.529"></a>
<FONT color="green">530</FONT>                round((striped[q] - '0')*1000);<a name="line.530"></a>
<FONT color="green">531</FONT>            }<a name="line.531"></a>
<FONT color="green">532</FONT>    <a name="line.532"></a>
<FONT color="green">533</FONT>        }<a name="line.533"></a>
<FONT color="green">534</FONT>    <a name="line.534"></a>
<FONT color="green">535</FONT>        /** Creates an instance with a non-finite value.<a name="line.535"></a>
<FONT color="green">536</FONT>         * @param field field to which this instance belongs<a name="line.536"></a>
<FONT color="green">537</FONT>         * @param sign sign of the Dfp to create<a name="line.537"></a>
<FONT color="green">538</FONT>         * @param nans code of the value, must be one of {@link #INFINITE},<a name="line.538"></a>
<FONT color="green">539</FONT>         * {@link #SNAN},  {@link #QNAN}<a name="line.539"></a>
<FONT color="green">540</FONT>         */<a name="line.540"></a>
<FONT color="green">541</FONT>        protected Dfp(final DfpField field, final byte sign, final byte nans) {<a name="line.541"></a>
<FONT color="green">542</FONT>            this.field = field;<a name="line.542"></a>
<FONT color="green">543</FONT>            this.mant    = new int[field.getRadixDigits()];<a name="line.543"></a>
<FONT color="green">544</FONT>            this.sign    = sign;<a name="line.544"></a>
<FONT color="green">545</FONT>            this.exp     = 0;<a name="line.545"></a>
<FONT color="green">546</FONT>            this.nans    = nans;<a name="line.546"></a>
<FONT color="green">547</FONT>        }<a name="line.547"></a>
<FONT color="green">548</FONT>    <a name="line.548"></a>
<FONT color="green">549</FONT>        /** Create an instance with a value of 0.<a name="line.549"></a>
<FONT color="green">550</FONT>         * Use this internally in preference to constructors to facilitate subclasses<a name="line.550"></a>
<FONT color="green">551</FONT>         * @return a new instance with a value of 0<a name="line.551"></a>
<FONT color="green">552</FONT>         */<a name="line.552"></a>
<FONT color="green">553</FONT>        public Dfp newInstance() {<a name="line.553"></a>
<FONT color="green">554</FONT>            return new Dfp(getField());<a name="line.554"></a>
<FONT color="green">555</FONT>        }<a name="line.555"></a>
<FONT color="green">556</FONT>    <a name="line.556"></a>
<FONT color="green">557</FONT>        /** Create an instance from a byte value.<a name="line.557"></a>
<FONT color="green">558</FONT>         * @param x value to convert to an instance<a name="line.558"></a>
<FONT color="green">559</FONT>         * @return a new instance with value x<a name="line.559"></a>
<FONT color="green">560</FONT>         */<a name="line.560"></a>
<FONT color="green">561</FONT>        public Dfp newInstance(final byte x) {<a name="line.561"></a>
<FONT color="green">562</FONT>            return new Dfp(getField(), x);<a name="line.562"></a>
<FONT color="green">563</FONT>        }<a name="line.563"></a>
<FONT color="green">564</FONT>    <a name="line.564"></a>
<FONT color="green">565</FONT>        /** Create an instance from an int value.<a name="line.565"></a>
<FONT color="green">566</FONT>         * @param x value to convert to an instance<a name="line.566"></a>
<FONT color="green">567</FONT>         * @return a new instance with value x<a name="line.567"></a>
<FONT color="green">568</FONT>         */<a name="line.568"></a>
<FONT color="green">569</FONT>        public Dfp newInstance(final int x) {<a name="line.569"></a>
<FONT color="green">570</FONT>            return new Dfp(getField(), x);<a name="line.570"></a>
<FONT color="green">571</FONT>        }<a name="line.571"></a>
<FONT color="green">572</FONT>    <a name="line.572"></a>
<FONT color="green">573</FONT>        /** Create an instance from a long value.<a name="line.573"></a>
<FONT color="green">574</FONT>         * @param x value to convert to an instance<a name="line.574"></a>
<FONT color="green">575</FONT>         * @return a new instance with value x<a name="line.575"></a>
<FONT color="green">576</FONT>         */<a name="line.576"></a>
<FONT color="green">577</FONT>        public Dfp newInstance(final long x) {<a name="line.577"></a>
<FONT color="green">578</FONT>            return new Dfp(getField(), x);<a name="line.578"></a>
<FONT color="green">579</FONT>        }<a name="line.579"></a>
<FONT color="green">580</FONT>    <a name="line.580"></a>
<FONT color="green">581</FONT>        /** Create an instance from a double value.<a name="line.581"></a>
<FONT color="green">582</FONT>         * @param x value to convert to an instance<a name="line.582"></a>
<FONT color="green">583</FONT>         * @return a new instance with value x<a name="line.583"></a>
<FONT color="green">584</FONT>         */<a name="line.584"></a>
<FONT color="green">585</FONT>        public Dfp newInstance(final double x) {<a name="line.585"></a>
<FONT color="green">586</FONT>            return new Dfp(getField(), x);<a name="line.586"></a>
<FONT color="green">587</FONT>        }<a name="line.587"></a>
<FONT color="green">588</FONT>    <a name="line.588"></a>
<FONT color="green">589</FONT>        /** Create an instance by copying an existing one.<a name="line.589"></a>
<FONT color="green">590</FONT>         * Use this internally in preference to constructors to facilitate subclasses.<a name="line.590"></a>
<FONT color="green">591</FONT>         * @param d instance to copy<a name="line.591"></a>
<FONT color="green">592</FONT>         * @return a new instance with the same value as d<a name="line.592"></a>
<FONT color="green">593</FONT>         */<a name="line.593"></a>
<FONT color="green">594</FONT>        public Dfp newInstance(final Dfp d) {<a name="line.594"></a>
<FONT color="green">595</FONT>    <a name="line.595"></a>
<FONT color="green">596</FONT>            // make sure we don't mix number with different precision<a name="line.596"></a>
<FONT color="green">597</FONT>            if (field.getRadixDigits() != d.field.getRadixDigits()) {<a name="line.597"></a>
<FONT color="green">598</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INVALID);<a name="line.598"></a>
<FONT color="green">599</FONT>                final Dfp result = newInstance(getZero());<a name="line.599"></a>
<FONT color="green">600</FONT>                result.nans = QNAN;<a name="line.600"></a>
<FONT color="green">601</FONT>                return dotrap(DfpField.FLAG_INVALID, NEW_INSTANCE_TRAP, d, result);<a name="line.601"></a>
<FONT color="green">602</FONT>            }<a name="line.602"></a>
<FONT color="green">603</FONT>    <a name="line.603"></a>
<FONT color="green">604</FONT>            return new Dfp(d);<a name="line.604"></a>
<FONT color="green">605</FONT>    <a name="line.605"></a>
<FONT color="green">606</FONT>        }<a name="line.606"></a>
<FONT color="green">607</FONT>    <a name="line.607"></a>
<FONT color="green">608</FONT>        /** Create an instance from a String representation.<a name="line.608"></a>
<FONT color="green">609</FONT>         * Use this internally in preference to constructors to facilitate subclasses.<a name="line.609"></a>
<FONT color="green">610</FONT>         * @param s string representation of the instance<a name="line.610"></a>
<FONT color="green">611</FONT>         * @return a new instance parsed from specified string<a name="line.611"></a>
<FONT color="green">612</FONT>         */<a name="line.612"></a>
<FONT color="green">613</FONT>        public Dfp newInstance(final String s) {<a name="line.613"></a>
<FONT color="green">614</FONT>            return new Dfp(field, s);<a name="line.614"></a>
<FONT color="green">615</FONT>        }<a name="line.615"></a>
<FONT color="green">616</FONT>    <a name="line.616"></a>
<FONT color="green">617</FONT>        /** Creates an instance with a non-finite value.<a name="line.617"></a>
<FONT color="green">618</FONT>         * @param sig sign of the Dfp to create<a name="line.618"></a>
<FONT color="green">619</FONT>         * @param code code of the value, must be one of {@link #INFINITE},<a name="line.619"></a>
<FONT color="green">620</FONT>         * {@link #SNAN},  {@link #QNAN}<a name="line.620"></a>
<FONT color="green">621</FONT>         * @return a new instance with a non-finite value<a name="line.621"></a>
<FONT color="green">622</FONT>         */<a name="line.622"></a>
<FONT color="green">623</FONT>        public Dfp newInstance(final byte sig, final byte code) {<a name="line.623"></a>
<FONT color="green">624</FONT>            return field.newDfp(sig, code);<a name="line.624"></a>
<FONT color="green">625</FONT>        }<a name="line.625"></a>
<FONT color="green">626</FONT>    <a name="line.626"></a>
<FONT color="green">627</FONT>        /** Get the {@link org.apache.commons.math3.Field Field} (really a {@link DfpField}) to which the instance belongs.<a name="line.627"></a>
<FONT color="green">628</FONT>         * &lt;p&gt;<a name="line.628"></a>
<FONT color="green">629</FONT>         * The field is linked to the number of digits and acts as a factory<a name="line.629"></a>
<FONT color="green">630</FONT>         * for {@link Dfp} instances.<a name="line.630"></a>
<FONT color="green">631</FONT>         * &lt;/p&gt;<a name="line.631"></a>
<FONT color="green">632</FONT>         * @return {@link org.apache.commons.math3.Field Field} (really a {@link DfpField}) to which the instance belongs<a name="line.632"></a>
<FONT color="green">633</FONT>         */<a name="line.633"></a>
<FONT color="green">634</FONT>        public DfpField getField() {<a name="line.634"></a>
<FONT color="green">635</FONT>            return field;<a name="line.635"></a>
<FONT color="green">636</FONT>        }<a name="line.636"></a>
<FONT color="green">637</FONT>    <a name="line.637"></a>
<FONT color="green">638</FONT>        /** Get the number of radix digits of the instance.<a name="line.638"></a>
<FONT color="green">639</FONT>         * @return number of radix digits<a name="line.639"></a>
<FONT color="green">640</FONT>         */<a name="line.640"></a>
<FONT color="green">641</FONT>        public int getRadixDigits() {<a name="line.641"></a>
<FONT color="green">642</FONT>            return field.getRadixDigits();<a name="line.642"></a>
<FONT color="green">643</FONT>        }<a name="line.643"></a>
<FONT color="green">644</FONT>    <a name="line.644"></a>
<FONT color="green">645</FONT>        /** Get the constant 0.<a name="line.645"></a>
<FONT color="green">646</FONT>         * @return a Dfp with value zero<a name="line.646"></a>
<FONT color="green">647</FONT>         */<a name="line.647"></a>
<FONT color="green">648</FONT>        public Dfp getZero() {<a name="line.648"></a>
<FONT color="green">649</FONT>            return field.getZero();<a name="line.649"></a>
<FONT color="green">650</FONT>        }<a name="line.650"></a>
<FONT color="green">651</FONT>    <a name="line.651"></a>
<FONT color="green">652</FONT>        /** Get the constant 1.<a name="line.652"></a>
<FONT color="green">653</FONT>         * @return a Dfp with value one<a name="line.653"></a>
<FONT color="green">654</FONT>         */<a name="line.654"></a>
<FONT color="green">655</FONT>        public Dfp getOne() {<a name="line.655"></a>
<FONT color="green">656</FONT>            return field.getOne();<a name="line.656"></a>
<FONT color="green">657</FONT>        }<a name="line.657"></a>
<FONT color="green">658</FONT>    <a name="line.658"></a>
<FONT color="green">659</FONT>        /** Get the constant 2.<a name="line.659"></a>
<FONT color="green">660</FONT>         * @return a Dfp with value two<a name="line.660"></a>
<FONT color="green">661</FONT>         */<a name="line.661"></a>
<FONT color="green">662</FONT>        public Dfp getTwo() {<a name="line.662"></a>
<FONT color="green">663</FONT>            return field.getTwo();<a name="line.663"></a>
<FONT color="green">664</FONT>        }<a name="line.664"></a>
<FONT color="green">665</FONT>    <a name="line.665"></a>
<FONT color="green">666</FONT>        /** Shift the mantissa left, and adjust the exponent to compensate.<a name="line.666"></a>
<FONT color="green">667</FONT>         */<a name="line.667"></a>
<FONT color="green">668</FONT>        protected void shiftLeft() {<a name="line.668"></a>
<FONT color="green">669</FONT>            for (int i = mant.length - 1; i &gt; 0; i--) {<a name="line.669"></a>
<FONT color="green">670</FONT>                mant[i] = mant[i-1];<a name="line.670"></a>
<FONT color="green">671</FONT>            }<a name="line.671"></a>
<FONT color="green">672</FONT>            mant[0] = 0;<a name="line.672"></a>
<FONT color="green">673</FONT>            exp--;<a name="line.673"></a>
<FONT color="green">674</FONT>        }<a name="line.674"></a>
<FONT color="green">675</FONT>    <a name="line.675"></a>
<FONT color="green">676</FONT>        /* Note that shiftRight() does not call round() as that round() itself<a name="line.676"></a>
<FONT color="green">677</FONT>         uses shiftRight() */<a name="line.677"></a>
<FONT color="green">678</FONT>        /** Shift the mantissa right, and adjust the exponent to compensate.<a name="line.678"></a>
<FONT color="green">679</FONT>         */<a name="line.679"></a>
<FONT color="green">680</FONT>        protected void shiftRight() {<a name="line.680"></a>
<FONT color="green">681</FONT>            for (int i = 0; i &lt; mant.length - 1; i++) {<a name="line.681"></a>
<FONT color="green">682</FONT>                mant[i] = mant[i+1];<a name="line.682"></a>
<FONT color="green">683</FONT>            }<a name="line.683"></a>
<FONT color="green">684</FONT>            mant[mant.length - 1] = 0;<a name="line.684"></a>
<FONT color="green">685</FONT>            exp++;<a name="line.685"></a>
<FONT color="green">686</FONT>        }<a name="line.686"></a>
<FONT color="green">687</FONT>    <a name="line.687"></a>
<FONT color="green">688</FONT>        /** Make our exp equal to the supplied one, this may cause rounding.<a name="line.688"></a>
<FONT color="green">689</FONT>         *  Also causes de-normalized numbers.  These numbers are generally<a name="line.689"></a>
<FONT color="green">690</FONT>         *  dangerous because most routines assume normalized numbers.<a name="line.690"></a>
<FONT color="green">691</FONT>         *  Align doesn't round, so it will return the last digit destroyed<a name="line.691"></a>
<FONT color="green">692</FONT>         *  by shifting right.<a name="line.692"></a>
<FONT color="green">693</FONT>         *  @param e desired exponent<a name="line.693"></a>
<FONT color="green">694</FONT>         *  @return last digit destroyed by shifting right<a name="line.694"></a>
<FONT color="green">695</FONT>         */<a name="line.695"></a>
<FONT color="green">696</FONT>        protected int align(int e) {<a name="line.696"></a>
<FONT color="green">697</FONT>            int lostdigit = 0;<a name="line.697"></a>
<FONT color="green">698</FONT>            boolean inexact = false;<a name="line.698"></a>
<FONT color="green">699</FONT>    <a name="line.699"></a>
<FONT color="green">700</FONT>            int diff = exp - e;<a name="line.700"></a>
<FONT color="green">701</FONT>    <a name="line.701"></a>
<FONT color="green">702</FONT>            int adiff = diff;<a name="line.702"></a>
<FONT color="green">703</FONT>            if (adiff &lt; 0) {<a name="line.703"></a>
<FONT color="green">704</FONT>                adiff = -adiff;<a name="line.704"></a>
<FONT color="green">705</FONT>            }<a name="line.705"></a>
<FONT color="green">706</FONT>    <a name="line.706"></a>
<FONT color="green">707</FONT>            if (diff == 0) {<a name="line.707"></a>
<FONT color="green">708</FONT>                return 0;<a name="line.708"></a>
<FONT color="green">709</FONT>            }<a name="line.709"></a>
<FONT color="green">710</FONT>    <a name="line.710"></a>
<FONT color="green">711</FONT>            if (adiff &gt; (mant.length + 1)) {<a name="line.711"></a>
<FONT color="green">712</FONT>                // Special case<a name="line.712"></a>
<FONT color="green">713</FONT>                Arrays.fill(mant, 0);<a name="line.713"></a>
<FONT color="green">714</FONT>                exp = e;<a name="line.714"></a>
<FONT color="green">715</FONT>    <a name="line.715"></a>
<FONT color="green">716</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INEXACT);<a name="line.716"></a>
<FONT color="green">717</FONT>                dotrap(DfpField.FLAG_INEXACT, ALIGN_TRAP, this, this);<a name="line.717"></a>
<FONT color="green">718</FONT>    <a name="line.718"></a>
<FONT color="green">719</FONT>                return 0;<a name="line.719"></a>
<FONT color="green">720</FONT>            }<a name="line.720"></a>
<FONT color="green">721</FONT>    <a name="line.721"></a>
<FONT color="green">722</FONT>            for (int i = 0; i &lt; adiff; i++) {<a name="line.722"></a>
<FONT color="green">723</FONT>                if (diff &lt; 0) {<a name="line.723"></a>
<FONT color="green">724</FONT>                    /* Keep track of loss -- only signal inexact after losing 2 digits.<a name="line.724"></a>
<FONT color="green">725</FONT>                     * the first lost digit is returned to add() and may be incorporated<a name="line.725"></a>
<FONT color="green">726</FONT>                     * into the result.<a name="line.726"></a>
<FONT color="green">727</FONT>                     */<a name="line.727"></a>
<FONT color="green">728</FONT>                    if (lostdigit != 0) {<a name="line.728"></a>
<FONT color="green">729</FONT>                        inexact = true;<a name="line.729"></a>
<FONT color="green">730</FONT>                    }<a name="line.730"></a>
<FONT color="green">731</FONT>    <a name="line.731"></a>
<FONT color="green">732</FONT>                    lostdigit = mant[0];<a name="line.732"></a>
<FONT color="green">733</FONT>    <a name="line.733"></a>
<FONT color="green">734</FONT>                    shiftRight();<a name="line.734"></a>
<FONT color="green">735</FONT>                } else {<a name="line.735"></a>
<FONT color="green">736</FONT>                    shiftLeft();<a name="line.736"></a>
<FONT color="green">737</FONT>                }<a name="line.737"></a>
<FONT color="green">738</FONT>            }<a name="line.738"></a>
<FONT color="green">739</FONT>    <a name="line.739"></a>
<FONT color="green">740</FONT>            if (inexact) {<a name="line.740"></a>
<FONT color="green">741</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INEXACT);<a name="line.741"></a>
<FONT color="green">742</FONT>                dotrap(DfpField.FLAG_INEXACT, ALIGN_TRAP, this, this);<a name="line.742"></a>
<FONT color="green">743</FONT>            }<a name="line.743"></a>
<FONT color="green">744</FONT>    <a name="line.744"></a>
<FONT color="green">745</FONT>            return lostdigit;<a name="line.745"></a>
<FONT color="green">746</FONT>    <a name="line.746"></a>
<FONT color="green">747</FONT>        }<a name="line.747"></a>
<FONT color="green">748</FONT>    <a name="line.748"></a>
<FONT color="green">749</FONT>        /** Check if instance is less than x.<a name="line.749"></a>
<FONT color="green">750</FONT>         * @param x number to check instance against<a name="line.750"></a>
<FONT color="green">751</FONT>         * @return true if instance is less than x and neither are NaN, false otherwise<a name="line.751"></a>
<FONT color="green">752</FONT>         */<a name="line.752"></a>
<FONT color="green">753</FONT>        public boolean lessThan(final Dfp x) {<a name="line.753"></a>
<FONT color="green">754</FONT>    <a name="line.754"></a>
<FONT color="green">755</FONT>            // make sure we don't mix number with different precision<a name="line.755"></a>
<FONT color="green">756</FONT>            if (field.getRadixDigits() != x.field.getRadixDigits()) {<a name="line.756"></a>
<FONT color="green">757</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INVALID);<a name="line.757"></a>
<FONT color="green">758</FONT>                final Dfp result = newInstance(getZero());<a name="line.758"></a>
<FONT color="green">759</FONT>                result.nans = QNAN;<a name="line.759"></a>
<FONT color="green">760</FONT>                dotrap(DfpField.FLAG_INVALID, LESS_THAN_TRAP, x, result);<a name="line.760"></a>
<FONT color="green">761</FONT>                return false;<a name="line.761"></a>
<FONT color="green">762</FONT>            }<a name="line.762"></a>
<FONT color="green">763</FONT>    <a name="line.763"></a>
<FONT color="green">764</FONT>            /* if a nan is involved, signal invalid and return false */<a name="line.764"></a>
<FONT color="green">765</FONT>            if (isNaN() || x.isNaN()) {<a name="line.765"></a>
<FONT color="green">766</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INVALID);<a name="line.766"></a>
<FONT color="green">767</FONT>                dotrap(DfpField.FLAG_INVALID, LESS_THAN_TRAP, x, newInstance(getZero()));<a name="line.767"></a>
<FONT color="green">768</FONT>                return false;<a name="line.768"></a>
<FONT color="green">769</FONT>            }<a name="line.769"></a>
<FONT color="green">770</FONT>    <a name="line.770"></a>
<FONT color="green">771</FONT>            return compare(this, x) &lt; 0;<a name="line.771"></a>
<FONT color="green">772</FONT>        }<a name="line.772"></a>
<FONT color="green">773</FONT>    <a name="line.773"></a>
<FONT color="green">774</FONT>        /** Check if instance is greater than x.<a name="line.774"></a>
<FONT color="green">775</FONT>         * @param x number to check instance against<a name="line.775"></a>
<FONT color="green">776</FONT>         * @return true if instance is greater than x and neither are NaN, false otherwise<a name="line.776"></a>
<FONT color="green">777</FONT>         */<a name="line.777"></a>
<FONT color="green">778</FONT>        public boolean greaterThan(final Dfp x) {<a name="line.778"></a>
<FONT color="green">779</FONT>    <a name="line.779"></a>
<FONT color="green">780</FONT>            // make sure we don't mix number with different precision<a name="line.780"></a>
<FONT color="green">781</FONT>            if (field.getRadixDigits() != x.field.getRadixDigits()) {<a name="line.781"></a>
<FONT color="green">782</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INVALID);<a name="line.782"></a>
<FONT color="green">783</FONT>                final Dfp result = newInstance(getZero());<a name="line.783"></a>
<FONT color="green">784</FONT>                result.nans = QNAN;<a name="line.784"></a>
<FONT color="green">785</FONT>                dotrap(DfpField.FLAG_INVALID, GREATER_THAN_TRAP, x, result);<a name="line.785"></a>
<FONT color="green">786</FONT>                return false;<a name="line.786"></a>
<FONT color="green">787</FONT>            }<a name="line.787"></a>
<FONT color="green">788</FONT>    <a name="line.788"></a>
<FONT color="green">789</FONT>            /* if a nan is involved, signal invalid and return false */<a name="line.789"></a>
<FONT color="green">790</FONT>            if (isNaN() || x.isNaN()) {<a name="line.790"></a>
<FONT color="green">791</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INVALID);<a name="line.791"></a>
<FONT color="green">792</FONT>                dotrap(DfpField.FLAG_INVALID, GREATER_THAN_TRAP, x, newInstance(getZero()));<a name="line.792"></a>
<FONT color="green">793</FONT>                return false;<a name="line.793"></a>
<FONT color="green">794</FONT>            }<a name="line.794"></a>
<FONT color="green">795</FONT>    <a name="line.795"></a>
<FONT color="green">796</FONT>            return compare(this, x) &gt; 0;<a name="line.796"></a>
<FONT color="green">797</FONT>        }<a name="line.797"></a>
<FONT color="green">798</FONT>    <a name="line.798"></a>
<FONT color="green">799</FONT>        /** Check if instance is less than or equal to 0.<a name="line.799"></a>
<FONT color="green">800</FONT>         * @return true if instance is not NaN and less than or equal to 0, false otherwise<a name="line.800"></a>
<FONT color="green">801</FONT>         */<a name="line.801"></a>
<FONT color="green">802</FONT>        public boolean negativeOrNull() {<a name="line.802"></a>
<FONT color="green">803</FONT>    <a name="line.803"></a>
<FONT color="green">804</FONT>            if (isNaN()) {<a name="line.804"></a>
<FONT color="green">805</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INVALID);<a name="line.805"></a>
<FONT color="green">806</FONT>                dotrap(DfpField.FLAG_INVALID, LESS_THAN_TRAP, this, newInstance(getZero()));<a name="line.806"></a>
<FONT color="green">807</FONT>                return false;<a name="line.807"></a>
<FONT color="green">808</FONT>            }<a name="line.808"></a>
<FONT color="green">809</FONT>    <a name="line.809"></a>
<FONT color="green">810</FONT>            return (sign &lt; 0) || ((mant[mant.length - 1] == 0) &amp;&amp; !isInfinite());<a name="line.810"></a>
<FONT color="green">811</FONT>    <a name="line.811"></a>
<FONT color="green">812</FONT>        }<a name="line.812"></a>
<FONT color="green">813</FONT>    <a name="line.813"></a>
<FONT color="green">814</FONT>        /** Check if instance is strictly less than 0.<a name="line.814"></a>
<FONT color="green">815</FONT>         * @return true if instance is not NaN and less than or equal to 0, false otherwise<a name="line.815"></a>
<FONT color="green">816</FONT>         */<a name="line.816"></a>
<FONT color="green">817</FONT>        public boolean strictlyNegative() {<a name="line.817"></a>
<FONT color="green">818</FONT>    <a name="line.818"></a>
<FONT color="green">819</FONT>            if (isNaN()) {<a name="line.819"></a>
<FONT color="green">820</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INVALID);<a name="line.820"></a>
<FONT color="green">821</FONT>                dotrap(DfpField.FLAG_INVALID, LESS_THAN_TRAP, this, newInstance(getZero()));<a name="line.821"></a>
<FONT color="green">822</FONT>                return false;<a name="line.822"></a>
<FONT color="green">823</FONT>            }<a name="line.823"></a>
<FONT color="green">824</FONT>    <a name="line.824"></a>
<FONT color="green">825</FONT>            return (sign &lt; 0) &amp;&amp; ((mant[mant.length - 1] != 0) || isInfinite());<a name="line.825"></a>
<FONT color="green">826</FONT>    <a name="line.826"></a>
<FONT color="green">827</FONT>        }<a name="line.827"></a>
<FONT color="green">828</FONT>    <a name="line.828"></a>
<FONT color="green">829</FONT>        /** Check if instance is greater than or equal to 0.<a name="line.829"></a>
<FONT color="green">830</FONT>         * @return true if instance is not NaN and greater than or equal to 0, false otherwise<a name="line.830"></a>
<FONT color="green">831</FONT>         */<a name="line.831"></a>
<FONT color="green">832</FONT>        public boolean positiveOrNull() {<a name="line.832"></a>
<FONT color="green">833</FONT>    <a name="line.833"></a>
<FONT color="green">834</FONT>            if (isNaN()) {<a name="line.834"></a>
<FONT color="green">835</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INVALID);<a name="line.835"></a>
<FONT color="green">836</FONT>                dotrap(DfpField.FLAG_INVALID, LESS_THAN_TRAP, this, newInstance(getZero()));<a name="line.836"></a>
<FONT color="green">837</FONT>                return false;<a name="line.837"></a>
<FONT color="green">838</FONT>            }<a name="line.838"></a>
<FONT color="green">839</FONT>    <a name="line.839"></a>
<FONT color="green">840</FONT>            return (sign &gt; 0) || ((mant[mant.length - 1] == 0) &amp;&amp; !isInfinite());<a name="line.840"></a>
<FONT color="green">841</FONT>    <a name="line.841"></a>
<FONT color="green">842</FONT>        }<a name="line.842"></a>
<FONT color="green">843</FONT>    <a name="line.843"></a>
<FONT color="green">844</FONT>        /** Check if instance is strictly greater than 0.<a name="line.844"></a>
<FONT color="green">845</FONT>         * @return true if instance is not NaN and greater than or equal to 0, false otherwise<a name="line.845"></a>
<FONT color="green">846</FONT>         */<a name="line.846"></a>
<FONT color="green">847</FONT>        public boolean strictlyPositive() {<a name="line.847"></a>
<FONT color="green">848</FONT>    <a name="line.848"></a>
<FONT color="green">849</FONT>            if (isNaN()) {<a name="line.849"></a>
<FONT color="green">850</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INVALID);<a name="line.850"></a>
<FONT color="green">851</FONT>                dotrap(DfpField.FLAG_INVALID, LESS_THAN_TRAP, this, newInstance(getZero()));<a name="line.851"></a>
<FONT color="green">852</FONT>                return false;<a name="line.852"></a>
<FONT color="green">853</FONT>            }<a name="line.853"></a>
<FONT color="green">854</FONT>    <a name="line.854"></a>
<FONT color="green">855</FONT>            return (sign &gt; 0) &amp;&amp; ((mant[mant.length - 1] != 0) || isInfinite());<a name="line.855"></a>
<FONT color="green">856</FONT>    <a name="line.856"></a>
<FONT color="green">857</FONT>        }<a name="line.857"></a>
<FONT color="green">858</FONT>    <a name="line.858"></a>
<FONT color="green">859</FONT>        /** Get the absolute value of instance.<a name="line.859"></a>
<FONT color="green">860</FONT>         * @return absolute value of instance<a name="line.860"></a>
<FONT color="green">861</FONT>         */<a name="line.861"></a>
<FONT color="green">862</FONT>        public Dfp abs() {<a name="line.862"></a>
<FONT color="green">863</FONT>            Dfp result = newInstance(this);<a name="line.863"></a>
<FONT color="green">864</FONT>            result.sign = 1;<a name="line.864"></a>
<FONT color="green">865</FONT>            return result;<a name="line.865"></a>
<FONT color="green">866</FONT>        }<a name="line.866"></a>
<FONT color="green">867</FONT>    <a name="line.867"></a>
<FONT color="green">868</FONT>        /** Check if instance is infinite.<a name="line.868"></a>
<FONT color="green">869</FONT>         * @return true if instance is infinite<a name="line.869"></a>
<FONT color="green">870</FONT>         */<a name="line.870"></a>
<FONT color="green">871</FONT>        public boolean isInfinite() {<a name="line.871"></a>
<FONT color="green">872</FONT>            return nans == INFINITE;<a name="line.872"></a>
<FONT color="green">873</FONT>        }<a name="line.873"></a>
<FONT color="green">874</FONT>    <a name="line.874"></a>
<FONT color="green">875</FONT>        /** Check if instance is not a number.<a name="line.875"></a>
<FONT color="green">876</FONT>         * @return true if instance is not a number<a name="line.876"></a>
<FONT color="green">877</FONT>         */<a name="line.877"></a>
<FONT color="green">878</FONT>        public boolean isNaN() {<a name="line.878"></a>
<FONT color="green">879</FONT>            return (nans == QNAN) || (nans == SNAN);<a name="line.879"></a>
<FONT color="green">880</FONT>        }<a name="line.880"></a>
<FONT color="green">881</FONT>    <a name="line.881"></a>
<FONT color="green">882</FONT>        /** Check if instance is equal to zero.<a name="line.882"></a>
<FONT color="green">883</FONT>         * @return true if instance is equal to zero<a name="line.883"></a>
<FONT color="green">884</FONT>         */<a name="line.884"></a>
<FONT color="green">885</FONT>        public boolean isZero() {<a name="line.885"></a>
<FONT color="green">886</FONT>    <a name="line.886"></a>
<FONT color="green">887</FONT>            if (isNaN()) {<a name="line.887"></a>
<FONT color="green">888</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INVALID);<a name="line.888"></a>
<FONT color="green">889</FONT>                dotrap(DfpField.FLAG_INVALID, LESS_THAN_TRAP, this, newInstance(getZero()));<a name="line.889"></a>
<FONT color="green">890</FONT>                return false;<a name="line.890"></a>
<FONT color="green">891</FONT>            }<a name="line.891"></a>
<FONT color="green">892</FONT>    <a name="line.892"></a>
<FONT color="green">893</FONT>            return (mant[mant.length - 1] == 0) &amp;&amp; !isInfinite();<a name="line.893"></a>
<FONT color="green">894</FONT>    <a name="line.894"></a>
<FONT color="green">895</FONT>        }<a name="line.895"></a>
<FONT color="green">896</FONT>    <a name="line.896"></a>
<FONT color="green">897</FONT>        /** Check if instance is equal to x.<a name="line.897"></a>
<FONT color="green">898</FONT>         * @param other object to check instance against<a name="line.898"></a>
<FONT color="green">899</FONT>         * @return true if instance is equal to x and neither are NaN, false otherwise<a name="line.899"></a>
<FONT color="green">900</FONT>         */<a name="line.900"></a>
<FONT color="green">901</FONT>        @Override<a name="line.901"></a>
<FONT color="green">902</FONT>        public boolean equals(final Object other) {<a name="line.902"></a>
<FONT color="green">903</FONT>    <a name="line.903"></a>
<FONT color="green">904</FONT>            if (other instanceof Dfp) {<a name="line.904"></a>
<FONT color="green">905</FONT>                final Dfp x = (Dfp) other;<a name="line.905"></a>
<FONT color="green">906</FONT>                if (isNaN() || x.isNaN() || field.getRadixDigits() != x.field.getRadixDigits()) {<a name="line.906"></a>
<FONT color="green">907</FONT>                    return false;<a name="line.907"></a>
<FONT color="green">908</FONT>                }<a name="line.908"></a>
<FONT color="green">909</FONT>    <a name="line.909"></a>
<FONT color="green">910</FONT>                return compare(this, x) == 0;<a name="line.910"></a>
<FONT color="green">911</FONT>            }<a name="line.911"></a>
<FONT color="green">912</FONT>    <a name="line.912"></a>
<FONT color="green">913</FONT>            return false;<a name="line.913"></a>
<FONT color="green">914</FONT>    <a name="line.914"></a>
<FONT color="green">915</FONT>        }<a name="line.915"></a>
<FONT color="green">916</FONT>    <a name="line.916"></a>
<FONT color="green">917</FONT>        /**<a name="line.917"></a>
<FONT color="green">918</FONT>         * Gets a hashCode for the instance.<a name="line.918"></a>
<FONT color="green">919</FONT>         * @return a hash code value for this object<a name="line.919"></a>
<FONT color="green">920</FONT>         */<a name="line.920"></a>
<FONT color="green">921</FONT>        @Override<a name="line.921"></a>
<FONT color="green">922</FONT>        public int hashCode() {<a name="line.922"></a>
<FONT color="green">923</FONT>            return 17 + (sign &lt;&lt; 8) + (nans &lt;&lt; 16) + exp + Arrays.hashCode(mant);<a name="line.923"></a>
<FONT color="green">924</FONT>        }<a name="line.924"></a>
<FONT color="green">925</FONT>    <a name="line.925"></a>
<FONT color="green">926</FONT>        /** Check if instance is not equal to x.<a name="line.926"></a>
<FONT color="green">927</FONT>         * @param x number to check instance against<a name="line.927"></a>
<FONT color="green">928</FONT>         * @return true if instance is not equal to x and neither are NaN, false otherwise<a name="line.928"></a>
<FONT color="green">929</FONT>         */<a name="line.929"></a>
<FONT color="green">930</FONT>        public boolean unequal(final Dfp x) {<a name="line.930"></a>
<FONT color="green">931</FONT>            if (isNaN() || x.isNaN() || field.getRadixDigits() != x.field.getRadixDigits()) {<a name="line.931"></a>
<FONT color="green">932</FONT>                return false;<a name="line.932"></a>
<FONT color="green">933</FONT>            }<a name="line.933"></a>
<FONT color="green">934</FONT>    <a name="line.934"></a>
<FONT color="green">935</FONT>            return greaterThan(x) || lessThan(x);<a name="line.935"></a>
<FONT color="green">936</FONT>        }<a name="line.936"></a>
<FONT color="green">937</FONT>    <a name="line.937"></a>
<FONT color="green">938</FONT>        /** Compare two instances.<a name="line.938"></a>
<FONT color="green">939</FONT>         * @param a first instance in comparison<a name="line.939"></a>
<FONT color="green">940</FONT>         * @param b second instance in comparison<a name="line.940"></a>
<FONT color="green">941</FONT>         * @return -1 if a&lt;b, 1 if a&gt;b and 0 if a==b<a name="line.941"></a>
<FONT color="green">942</FONT>         *  Note this method does not properly handle NaNs or numbers with different precision.<a name="line.942"></a>
<FONT color="green">943</FONT>         */<a name="line.943"></a>
<FONT color="green">944</FONT>        private static int compare(final Dfp a, final Dfp b) {<a name="line.944"></a>
<FONT color="green">945</FONT>            // Ignore the sign of zero<a name="line.945"></a>
<FONT color="green">946</FONT>            if (a.mant[a.mant.length - 1] == 0 &amp;&amp; b.mant[b.mant.length - 1] == 0 &amp;&amp;<a name="line.946"></a>
<FONT color="green">947</FONT>                a.nans == FINITE &amp;&amp; b.nans == FINITE) {<a name="line.947"></a>
<FONT color="green">948</FONT>                return 0;<a name="line.948"></a>
<FONT color="green">949</FONT>            }<a name="line.949"></a>
<FONT color="green">950</FONT>    <a name="line.950"></a>
<FONT color="green">951</FONT>            if (a.sign != b.sign) {<a name="line.951"></a>
<FONT color="green">952</FONT>                if (a.sign == -1) {<a name="line.952"></a>
<FONT color="green">953</FONT>                    return -1;<a name="line.953"></a>
<FONT color="green">954</FONT>                } else {<a name="line.954"></a>
<FONT color="green">955</FONT>                    return 1;<a name="line.955"></a>
<FONT color="green">956</FONT>                }<a name="line.956"></a>
<FONT color="green">957</FONT>            }<a name="line.957"></a>
<FONT color="green">958</FONT>    <a name="line.958"></a>
<FONT color="green">959</FONT>            // deal with the infinities<a name="line.959"></a>
<FONT color="green">960</FONT>            if (a.nans == INFINITE &amp;&amp; b.nans == FINITE) {<a name="line.960"></a>
<FONT color="green">961</FONT>                return a.sign;<a name="line.961"></a>
<FONT color="green">962</FONT>            }<a name="line.962"></a>
<FONT color="green">963</FONT>    <a name="line.963"></a>
<FONT color="green">964</FONT>            if (a.nans == FINITE &amp;&amp; b.nans == INFINITE) {<a name="line.964"></a>
<FONT color="green">965</FONT>                return -b.sign;<a name="line.965"></a>
<FONT color="green">966</FONT>            }<a name="line.966"></a>
<FONT color="green">967</FONT>    <a name="line.967"></a>
<FONT color="green">968</FONT>            if (a.nans == INFINITE &amp;&amp; b.nans == INFINITE) {<a name="line.968"></a>
<FONT color="green">969</FONT>                return 0;<a name="line.969"></a>
<FONT color="green">970</FONT>            }<a name="line.970"></a>
<FONT color="green">971</FONT>    <a name="line.971"></a>
<FONT color="green">972</FONT>            // Handle special case when a or b is zero, by ignoring the exponents<a name="line.972"></a>
<FONT color="green">973</FONT>            if (b.mant[b.mant.length-1] != 0 &amp;&amp; a.mant[b.mant.length-1] != 0) {<a name="line.973"></a>
<FONT color="green">974</FONT>                if (a.exp &lt; b.exp) {<a name="line.974"></a>
<FONT color="green">975</FONT>                    return -a.sign;<a name="line.975"></a>
<FONT color="green">976</FONT>                }<a name="line.976"></a>
<FONT color="green">977</FONT>    <a name="line.977"></a>
<FONT color="green">978</FONT>                if (a.exp &gt; b.exp) {<a name="line.978"></a>
<FONT color="green">979</FONT>                    return a.sign;<a name="line.979"></a>
<FONT color="green">980</FONT>                }<a name="line.980"></a>
<FONT color="green">981</FONT>            }<a name="line.981"></a>
<FONT color="green">982</FONT>    <a name="line.982"></a>
<FONT color="green">983</FONT>            // compare the mantissas<a name="line.983"></a>
<FONT color="green">984</FONT>            for (int i = a.mant.length - 1; i &gt;= 0; i--) {<a name="line.984"></a>
<FONT color="green">985</FONT>                if (a.mant[i] &gt; b.mant[i]) {<a name="line.985"></a>
<FONT color="green">986</FONT>                    return a.sign;<a name="line.986"></a>
<FONT color="green">987</FONT>                }<a name="line.987"></a>
<FONT color="green">988</FONT>    <a name="line.988"></a>
<FONT color="green">989</FONT>                if (a.mant[i] &lt; b.mant[i]) {<a name="line.989"></a>
<FONT color="green">990</FONT>                    return -a.sign;<a name="line.990"></a>
<FONT color="green">991</FONT>                }<a name="line.991"></a>
<FONT color="green">992</FONT>            }<a name="line.992"></a>
<FONT color="green">993</FONT>    <a name="line.993"></a>
<FONT color="green">994</FONT>            return 0;<a name="line.994"></a>
<FONT color="green">995</FONT>    <a name="line.995"></a>
<FONT color="green">996</FONT>        }<a name="line.996"></a>
<FONT color="green">997</FONT>    <a name="line.997"></a>
<FONT color="green">998</FONT>        /** Round to nearest integer using the round-half-even method.<a name="line.998"></a>
<FONT color="green">999</FONT>         *  That is round to nearest integer unless both are equidistant.<a name="line.999"></a>
<FONT color="green">1000</FONT>         *  In which case round to the even one.<a name="line.1000"></a>
<FONT color="green">1001</FONT>         *  @return rounded value<a name="line.1001"></a>
<FONT color="green">1002</FONT>         */<a name="line.1002"></a>
<FONT color="green">1003</FONT>        public Dfp rint() {<a name="line.1003"></a>
<FONT color="green">1004</FONT>            return trunc(DfpField.RoundingMode.ROUND_HALF_EVEN);<a name="line.1004"></a>
<FONT color="green">1005</FONT>        }<a name="line.1005"></a>
<FONT color="green">1006</FONT>    <a name="line.1006"></a>
<FONT color="green">1007</FONT>        /** Round to an integer using the round floor mode.<a name="line.1007"></a>
<FONT color="green">1008</FONT>         * That is, round toward -Infinity<a name="line.1008"></a>
<FONT color="green">1009</FONT>         *  @return rounded value<a name="line.1009"></a>
<FONT color="green">1010</FONT>         */<a name="line.1010"></a>
<FONT color="green">1011</FONT>        public Dfp floor() {<a name="line.1011"></a>
<FONT color="green">1012</FONT>            return trunc(DfpField.RoundingMode.ROUND_FLOOR);<a name="line.1012"></a>
<FONT color="green">1013</FONT>        }<a name="line.1013"></a>
<FONT color="green">1014</FONT>    <a name="line.1014"></a>
<FONT color="green">1015</FONT>        /** Round to an integer using the round ceil mode.<a name="line.1015"></a>
<FONT color="green">1016</FONT>         * That is, round toward +Infinity<a name="line.1016"></a>
<FONT color="green">1017</FONT>         *  @return rounded value<a name="line.1017"></a>
<FONT color="green">1018</FONT>         */<a name="line.1018"></a>
<FONT color="green">1019</FONT>        public Dfp ceil() {<a name="line.1019"></a>
<FONT color="green">1020</FONT>            return trunc(DfpField.RoundingMode.ROUND_CEIL);<a name="line.1020"></a>
<FONT color="green">1021</FONT>        }<a name="line.1021"></a>
<FONT color="green">1022</FONT>    <a name="line.1022"></a>
<FONT color="green">1023</FONT>        /** Returns the IEEE remainder.<a name="line.1023"></a>
<FONT color="green">1024</FONT>         * @param d divisor<a name="line.1024"></a>
<FONT color="green">1025</FONT>         * @return this less n &amp;times; d, where n is the integer closest to this/d<a name="line.1025"></a>
<FONT color="green">1026</FONT>         */<a name="line.1026"></a>
<FONT color="green">1027</FONT>        public Dfp remainder(final Dfp d) {<a name="line.1027"></a>
<FONT color="green">1028</FONT>    <a name="line.1028"></a>
<FONT color="green">1029</FONT>            final Dfp result = this.subtract(this.divide(d).rint().multiply(d));<a name="line.1029"></a>
<FONT color="green">1030</FONT>    <a name="line.1030"></a>
<FONT color="green">1031</FONT>            // IEEE 854-1987 says that if the result is zero, then it carries the sign of this<a name="line.1031"></a>
<FONT color="green">1032</FONT>            if (result.mant[mant.length-1] == 0) {<a name="line.1032"></a>
<FONT color="green">1033</FONT>                result.sign = sign;<a name="line.1033"></a>
<FONT color="green">1034</FONT>            }<a name="line.1034"></a>
<FONT color="green">1035</FONT>    <a name="line.1035"></a>
<FONT color="green">1036</FONT>            return result;<a name="line.1036"></a>
<FONT color="green">1037</FONT>    <a name="line.1037"></a>
<FONT color="green">1038</FONT>        }<a name="line.1038"></a>
<FONT color="green">1039</FONT>    <a name="line.1039"></a>
<FONT color="green">1040</FONT>        /** Does the integer conversions with the specified rounding.<a name="line.1040"></a>
<FONT color="green">1041</FONT>         * @param rmode rounding mode to use<a name="line.1041"></a>
<FONT color="green">1042</FONT>         * @return truncated value<a name="line.1042"></a>
<FONT color="green">1043</FONT>         */<a name="line.1043"></a>
<FONT color="green">1044</FONT>        protected Dfp trunc(final DfpField.RoundingMode rmode) {<a name="line.1044"></a>
<FONT color="green">1045</FONT>            boolean changed = false;<a name="line.1045"></a>
<FONT color="green">1046</FONT>    <a name="line.1046"></a>
<FONT color="green">1047</FONT>            if (isNaN()) {<a name="line.1047"></a>
<FONT color="green">1048</FONT>                return newInstance(this);<a name="line.1048"></a>
<FONT color="green">1049</FONT>            }<a name="line.1049"></a>
<FONT color="green">1050</FONT>    <a name="line.1050"></a>
<FONT color="green">1051</FONT>            if (nans == INFINITE) {<a name="line.1051"></a>
<FONT color="green">1052</FONT>                return newInstance(this);<a name="line.1052"></a>
<FONT color="green">1053</FONT>            }<a name="line.1053"></a>
<FONT color="green">1054</FONT>    <a name="line.1054"></a>
<FONT color="green">1055</FONT>            if (mant[mant.length-1] == 0) {<a name="line.1055"></a>
<FONT color="green">1056</FONT>                // a is zero<a name="line.1056"></a>
<FONT color="green">1057</FONT>                return newInstance(this);<a name="line.1057"></a>
<FONT color="green">1058</FONT>            }<a name="line.1058"></a>
<FONT color="green">1059</FONT>    <a name="line.1059"></a>
<FONT color="green">1060</FONT>            /* If the exponent is less than zero then we can certainly<a name="line.1060"></a>
<FONT color="green">1061</FONT>             * return zero */<a name="line.1061"></a>
<FONT color="green">1062</FONT>            if (exp &lt; 0) {<a name="line.1062"></a>
<FONT color="green">1063</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INEXACT);<a name="line.1063"></a>
<FONT color="green">1064</FONT>                Dfp result = newInstance(getZero());<a name="line.1064"></a>
<FONT color="green">1065</FONT>                result = dotrap(DfpField.FLAG_INEXACT, TRUNC_TRAP, this, result);<a name="line.1065"></a>
<FONT color="green">1066</FONT>                return result;<a name="line.1066"></a>
<FONT color="green">1067</FONT>            }<a name="line.1067"></a>
<FONT color="green">1068</FONT>    <a name="line.1068"></a>
<FONT color="green">1069</FONT>            /* If the exponent is greater than or equal to digits, then it<a name="line.1069"></a>
<FONT color="green">1070</FONT>             * must already be an integer since there is no precision left<a name="line.1070"></a>
<FONT color="green">1071</FONT>             * for any fractional part */<a name="line.1071"></a>
<FONT color="green">1072</FONT>    <a name="line.1072"></a>
<FONT color="green">1073</FONT>            if (exp &gt;= mant.length) {<a name="line.1073"></a>
<FONT color="green">1074</FONT>                return newInstance(this);<a name="line.1074"></a>
<FONT color="green">1075</FONT>            }<a name="line.1075"></a>
<FONT color="green">1076</FONT>    <a name="line.1076"></a>
<FONT color="green">1077</FONT>            /* General case:  create another dfp, result, that contains the<a name="line.1077"></a>
<FONT color="green">1078</FONT>             * a with the fractional part lopped off.  */<a name="line.1078"></a>
<FONT color="green">1079</FONT>    <a name="line.1079"></a>
<FONT color="green">1080</FONT>            Dfp result = newInstance(this);<a name="line.1080"></a>
<FONT color="green">1081</FONT>            for (int i = 0; i &lt; mant.length-result.exp; i++) {<a name="line.1081"></a>
<FONT color="green">1082</FONT>                changed |= result.mant[i] != 0;<a name="line.1082"></a>
<FONT color="green">1083</FONT>                result.mant[i] = 0;<a name="line.1083"></a>
<FONT color="green">1084</FONT>            }<a name="line.1084"></a>
<FONT color="green">1085</FONT>    <a name="line.1085"></a>
<FONT color="green">1086</FONT>            if (changed) {<a name="line.1086"></a>
<FONT color="green">1087</FONT>                switch (rmode) {<a name="line.1087"></a>
<FONT color="green">1088</FONT>                    case ROUND_FLOOR:<a name="line.1088"></a>
<FONT color="green">1089</FONT>                        if (result.sign == -1) {<a name="line.1089"></a>
<FONT color="green">1090</FONT>                            // then we must increment the mantissa by one<a name="line.1090"></a>
<FONT color="green">1091</FONT>                            result = result.add(newInstance(-1));<a name="line.1091"></a>
<FONT color="green">1092</FONT>                        }<a name="line.1092"></a>
<FONT color="green">1093</FONT>                        break;<a name="line.1093"></a>
<FONT color="green">1094</FONT>    <a name="line.1094"></a>
<FONT color="green">1095</FONT>                    case ROUND_CEIL:<a name="line.1095"></a>
<FONT color="green">1096</FONT>                        if (result.sign == 1) {<a name="line.1096"></a>
<FONT color="green">1097</FONT>                            // then we must increment the mantissa by one<a name="line.1097"></a>
<FONT color="green">1098</FONT>                            result = result.add(getOne());<a name="line.1098"></a>
<FONT color="green">1099</FONT>                        }<a name="line.1099"></a>
<FONT color="green">1100</FONT>                        break;<a name="line.1100"></a>
<FONT color="green">1101</FONT>    <a name="line.1101"></a>
<FONT color="green">1102</FONT>                    case ROUND_HALF_EVEN:<a name="line.1102"></a>
<FONT color="green">1103</FONT>                    default:<a name="line.1103"></a>
<FONT color="green">1104</FONT>                        final Dfp half = newInstance("0.5");<a name="line.1104"></a>
<FONT color="green">1105</FONT>                        Dfp a = subtract(result);  // difference between this and result<a name="line.1105"></a>
<FONT color="green">1106</FONT>                        a.sign = 1;            // force positive (take abs)<a name="line.1106"></a>
<FONT color="green">1107</FONT>                        if (a.greaterThan(half)) {<a name="line.1107"></a>
<FONT color="green">1108</FONT>                            a = newInstance(getOne());<a name="line.1108"></a>
<FONT color="green">1109</FONT>                            a.sign = sign;<a name="line.1109"></a>
<FONT color="green">1110</FONT>                            result = result.add(a);<a name="line.1110"></a>
<FONT color="green">1111</FONT>                        }<a name="line.1111"></a>
<FONT color="green">1112</FONT>    <a name="line.1112"></a>
<FONT color="green">1113</FONT>                        /** If exactly equal to 1/2 and odd then increment */<a name="line.1113"></a>
<FONT color="green">1114</FONT>                        if (a.equals(half) &amp;&amp; result.exp &gt; 0 &amp;&amp; (result.mant[mant.length-result.exp]&amp;1) != 0) {<a name="line.1114"></a>
<FONT color="green">1115</FONT>                            a = newInstance(getOne());<a name="line.1115"></a>
<FONT color="green">1116</FONT>                            a.sign = sign;<a name="line.1116"></a>
<FONT color="green">1117</FONT>                            result = result.add(a);<a name="line.1117"></a>
<FONT color="green">1118</FONT>                        }<a name="line.1118"></a>
<FONT color="green">1119</FONT>                        break;<a name="line.1119"></a>
<FONT color="green">1120</FONT>                }<a name="line.1120"></a>
<FONT color="green">1121</FONT>    <a name="line.1121"></a>
<FONT color="green">1122</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INEXACT);  // signal inexact<a name="line.1122"></a>
<FONT color="green">1123</FONT>                result = dotrap(DfpField.FLAG_INEXACT, TRUNC_TRAP, this, result);<a name="line.1123"></a>
<FONT color="green">1124</FONT>                return result;<a name="line.1124"></a>
<FONT color="green">1125</FONT>            }<a name="line.1125"></a>
<FONT color="green">1126</FONT>    <a name="line.1126"></a>
<FONT color="green">1127</FONT>            return result;<a name="line.1127"></a>
<FONT color="green">1128</FONT>        }<a name="line.1128"></a>
<FONT color="green">1129</FONT>    <a name="line.1129"></a>
<FONT color="green">1130</FONT>        /** Convert this to an integer.<a name="line.1130"></a>
<FONT color="green">1131</FONT>         * If greater than 2147483647, it returns 2147483647. If less than -2147483648 it returns -2147483648.<a name="line.1131"></a>
<FONT color="green">1132</FONT>         * @return converted number<a name="line.1132"></a>
<FONT color="green">1133</FONT>         */<a name="line.1133"></a>
<FONT color="green">1134</FONT>        public int intValue() {<a name="line.1134"></a>
<FONT color="green">1135</FONT>            Dfp rounded;<a name="line.1135"></a>
<FONT color="green">1136</FONT>            int result = 0;<a name="line.1136"></a>
<FONT color="green">1137</FONT>    <a name="line.1137"></a>
<FONT color="green">1138</FONT>            rounded = rint();<a name="line.1138"></a>
<FONT color="green">1139</FONT>    <a name="line.1139"></a>
<FONT color="green">1140</FONT>            if (rounded.greaterThan(newInstance(2147483647))) {<a name="line.1140"></a>
<FONT color="green">1141</FONT>                return 2147483647;<a name="line.1141"></a>
<FONT color="green">1142</FONT>            }<a name="line.1142"></a>
<FONT color="green">1143</FONT>    <a name="line.1143"></a>
<FONT color="green">1144</FONT>            if (rounded.lessThan(newInstance(-2147483648))) {<a name="line.1144"></a>
<FONT color="green">1145</FONT>                return -2147483648;<a name="line.1145"></a>
<FONT color="green">1146</FONT>            }<a name="line.1146"></a>
<FONT color="green">1147</FONT>    <a name="line.1147"></a>
<FONT color="green">1148</FONT>            for (int i = mant.length - 1; i &gt;= mant.length - rounded.exp; i--) {<a name="line.1148"></a>
<FONT color="green">1149</FONT>                result = result * RADIX + rounded.mant[i];<a name="line.1149"></a>
<FONT color="green">1150</FONT>            }<a name="line.1150"></a>
<FONT color="green">1151</FONT>    <a name="line.1151"></a>
<FONT color="green">1152</FONT>            if (rounded.sign == -1) {<a name="line.1152"></a>
<FONT color="green">1153</FONT>                result = -result;<a name="line.1153"></a>
<FONT color="green">1154</FONT>            }<a name="line.1154"></a>
<FONT color="green">1155</FONT>    <a name="line.1155"></a>
<FONT color="green">1156</FONT>            return result;<a name="line.1156"></a>
<FONT color="green">1157</FONT>        }<a name="line.1157"></a>
<FONT color="green">1158</FONT>    <a name="line.1158"></a>
<FONT color="green">1159</FONT>        /** Get the exponent of the greatest power of 10000 that is<a name="line.1159"></a>
<FONT color="green">1160</FONT>         *  less than or equal to the absolute value of this.  I.E.  if<a name="line.1160"></a>
<FONT color="green">1161</FONT>         *  this is 10&lt;sup&gt;6&lt;/sup&gt; then log10K would return 1.<a name="line.1161"></a>
<FONT color="green">1162</FONT>         *  @return integer base 10000 logarithm<a name="line.1162"></a>
<FONT color="green">1163</FONT>         */<a name="line.1163"></a>
<FONT color="green">1164</FONT>        public int log10K() {<a name="line.1164"></a>
<FONT color="green">1165</FONT>            return exp - 1;<a name="line.1165"></a>
<FONT color="green">1166</FONT>        }<a name="line.1166"></a>
<FONT color="green">1167</FONT>    <a name="line.1167"></a>
<FONT color="green">1168</FONT>        /** Get the specified  power of 10000.<a name="line.1168"></a>
<FONT color="green">1169</FONT>         * @param e desired power<a name="line.1169"></a>
<FONT color="green">1170</FONT>         * @return 10000&lt;sup&gt;e&lt;/sup&gt;<a name="line.1170"></a>
<FONT color="green">1171</FONT>         */<a name="line.1171"></a>
<FONT color="green">1172</FONT>        public Dfp power10K(final int e) {<a name="line.1172"></a>
<FONT color="green">1173</FONT>            Dfp d = newInstance(getOne());<a name="line.1173"></a>
<FONT color="green">1174</FONT>            d.exp = e + 1;<a name="line.1174"></a>
<FONT color="green">1175</FONT>            return d;<a name="line.1175"></a>
<FONT color="green">1176</FONT>        }<a name="line.1176"></a>
<FONT color="green">1177</FONT>    <a name="line.1177"></a>
<FONT color="green">1178</FONT>        /** Get the exponent of the greatest power of 10 that is less than or equal to abs(this).<a name="line.1178"></a>
<FONT color="green">1179</FONT>         *  @return integer base 10 logarithm<a name="line.1179"></a>
<FONT color="green">1180</FONT>         */<a name="line.1180"></a>
<FONT color="green">1181</FONT>        public int log10()  {<a name="line.1181"></a>
<FONT color="green">1182</FONT>            if (mant[mant.length-1] &gt; 1000) {<a name="line.1182"></a>
<FONT color="green">1183</FONT>                return exp * 4 - 1;<a name="line.1183"></a>
<FONT color="green">1184</FONT>            }<a name="line.1184"></a>
<FONT color="green">1185</FONT>            if (mant[mant.length-1] &gt; 100) {<a name="line.1185"></a>
<FONT color="green">1186</FONT>                return exp * 4 - 2;<a name="line.1186"></a>
<FONT color="green">1187</FONT>            }<a name="line.1187"></a>
<FONT color="green">1188</FONT>            if (mant[mant.length-1] &gt; 10) {<a name="line.1188"></a>
<FONT color="green">1189</FONT>                return exp * 4 - 3;<a name="line.1189"></a>
<FONT color="green">1190</FONT>            }<a name="line.1190"></a>
<FONT color="green">1191</FONT>            return exp * 4 - 4;<a name="line.1191"></a>
<FONT color="green">1192</FONT>        }<a name="line.1192"></a>
<FONT color="green">1193</FONT>    <a name="line.1193"></a>
<FONT color="green">1194</FONT>        /** Return the specified  power of 10.<a name="line.1194"></a>
<FONT color="green">1195</FONT>         * @param e desired power<a name="line.1195"></a>
<FONT color="green">1196</FONT>         * @return 10&lt;sup&gt;e&lt;/sup&gt;<a name="line.1196"></a>
<FONT color="green">1197</FONT>         */<a name="line.1197"></a>
<FONT color="green">1198</FONT>        public Dfp power10(final int e) {<a name="line.1198"></a>
<FONT color="green">1199</FONT>            Dfp d = newInstance(getOne());<a name="line.1199"></a>
<FONT color="green">1200</FONT>    <a name="line.1200"></a>
<FONT color="green">1201</FONT>            if (e &gt;= 0) {<a name="line.1201"></a>
<FONT color="green">1202</FONT>                d.exp = e / 4 + 1;<a name="line.1202"></a>
<FONT color="green">1203</FONT>            } else {<a name="line.1203"></a>
<FONT color="green">1204</FONT>                d.exp = (e + 1) / 4;<a name="line.1204"></a>
<FONT color="green">1205</FONT>            }<a name="line.1205"></a>
<FONT color="green">1206</FONT>    <a name="line.1206"></a>
<FONT color="green">1207</FONT>            switch ((e % 4 + 4) % 4) {<a name="line.1207"></a>
<FONT color="green">1208</FONT>                case 0:<a name="line.1208"></a>
<FONT color="green">1209</FONT>                    break;<a name="line.1209"></a>
<FONT color="green">1210</FONT>                case 1:<a name="line.1210"></a>
<FONT color="green">1211</FONT>                    d = d.multiply(10);<a name="line.1211"></a>
<FONT color="green">1212</FONT>                    break;<a name="line.1212"></a>
<FONT color="green">1213</FONT>                case 2:<a name="line.1213"></a>
<FONT color="green">1214</FONT>                    d = d.multiply(100);<a name="line.1214"></a>
<FONT color="green">1215</FONT>                    break;<a name="line.1215"></a>
<FONT color="green">1216</FONT>                default:<a name="line.1216"></a>
<FONT color="green">1217</FONT>                    d = d.multiply(1000);<a name="line.1217"></a>
<FONT color="green">1218</FONT>            }<a name="line.1218"></a>
<FONT color="green">1219</FONT>    <a name="line.1219"></a>
<FONT color="green">1220</FONT>            return d;<a name="line.1220"></a>
<FONT color="green">1221</FONT>        }<a name="line.1221"></a>
<FONT color="green">1222</FONT>    <a name="line.1222"></a>
<FONT color="green">1223</FONT>        /** Negate the mantissa of this by computing the complement.<a name="line.1223"></a>
<FONT color="green">1224</FONT>         *  Leaves the sign bit unchanged, used internally by add.<a name="line.1224"></a>
<FONT color="green">1225</FONT>         *  Denormalized numbers are handled properly here.<a name="line.1225"></a>
<FONT color="green">1226</FONT>         *  @param extra ???<a name="line.1226"></a>
<FONT color="green">1227</FONT>         *  @return ???<a name="line.1227"></a>
<FONT color="green">1228</FONT>         */<a name="line.1228"></a>
<FONT color="green">1229</FONT>        protected int complement(int extra) {<a name="line.1229"></a>
<FONT color="green">1230</FONT>    <a name="line.1230"></a>
<FONT color="green">1231</FONT>            extra = RADIX-extra;<a name="line.1231"></a>
<FONT color="green">1232</FONT>            for (int i = 0; i &lt; mant.length; i++) {<a name="line.1232"></a>
<FONT color="green">1233</FONT>                mant[i] = RADIX-mant[i]-1;<a name="line.1233"></a>
<FONT color="green">1234</FONT>            }<a name="line.1234"></a>
<FONT color="green">1235</FONT>    <a name="line.1235"></a>
<FONT color="green">1236</FONT>            int rh = extra / RADIX;<a name="line.1236"></a>
<FONT color="green">1237</FONT>            extra = extra - rh * RADIX;<a name="line.1237"></a>
<FONT color="green">1238</FONT>            for (int i = 0; i &lt; mant.length; i++) {<a name="line.1238"></a>
<FONT color="green">1239</FONT>                final int r = mant[i] + rh;<a name="line.1239"></a>
<FONT color="green">1240</FONT>                rh = r / RADIX;<a name="line.1240"></a>
<FONT color="green">1241</FONT>                mant[i] = r - rh * RADIX;<a name="line.1241"></a>
<FONT color="green">1242</FONT>            }<a name="line.1242"></a>
<FONT color="green">1243</FONT>    <a name="line.1243"></a>
<FONT color="green">1244</FONT>            return extra;<a name="line.1244"></a>
<FONT color="green">1245</FONT>        }<a name="line.1245"></a>
<FONT color="green">1246</FONT>    <a name="line.1246"></a>
<FONT color="green">1247</FONT>        /** Add x to this.<a name="line.1247"></a>
<FONT color="green">1248</FONT>         * @param x number to add<a name="line.1248"></a>
<FONT color="green">1249</FONT>         * @return sum of this and x<a name="line.1249"></a>
<FONT color="green">1250</FONT>         */<a name="line.1250"></a>
<FONT color="green">1251</FONT>        public Dfp add(final Dfp x) {<a name="line.1251"></a>
<FONT color="green">1252</FONT>    <a name="line.1252"></a>
<FONT color="green">1253</FONT>            // make sure we don't mix number with different precision<a name="line.1253"></a>
<FONT color="green">1254</FONT>            if (field.getRadixDigits() != x.field.getRadixDigits()) {<a name="line.1254"></a>
<FONT color="green">1255</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INVALID);<a name="line.1255"></a>
<FONT color="green">1256</FONT>                final Dfp result = newInstance(getZero());<a name="line.1256"></a>
<FONT color="green">1257</FONT>                result.nans = QNAN;<a name="line.1257"></a>
<FONT color="green">1258</FONT>                return dotrap(DfpField.FLAG_INVALID, ADD_TRAP, x, result);<a name="line.1258"></a>
<FONT color="green">1259</FONT>            }<a name="line.1259"></a>
<FONT color="green">1260</FONT>    <a name="line.1260"></a>
<FONT color="green">1261</FONT>            /* handle special cases */<a name="line.1261"></a>
<FONT color="green">1262</FONT>            if (nans != FINITE || x.nans != FINITE) {<a name="line.1262"></a>
<FONT color="green">1263</FONT>                if (isNaN()) {<a name="line.1263"></a>
<FONT color="green">1264</FONT>                    return this;<a name="line.1264"></a>
<FONT color="green">1265</FONT>                }<a name="line.1265"></a>
<FONT color="green">1266</FONT>    <a name="line.1266"></a>
<FONT color="green">1267</FONT>                if (x.isNaN()) {<a name="line.1267"></a>
<FONT color="green">1268</FONT>                    return x;<a name="line.1268"></a>
<FONT color="green">1269</FONT>                }<a name="line.1269"></a>
<FONT color="green">1270</FONT>    <a name="line.1270"></a>
<FONT color="green">1271</FONT>                if (nans == INFINITE &amp;&amp; x.nans == FINITE) {<a name="line.1271"></a>
<FONT color="green">1272</FONT>                    return this;<a name="line.1272"></a>
<FONT color="green">1273</FONT>                }<a name="line.1273"></a>
<FONT color="green">1274</FONT>    <a name="line.1274"></a>
<FONT color="green">1275</FONT>                if (x.nans == INFINITE &amp;&amp; nans == FINITE) {<a name="line.1275"></a>
<FONT color="green">1276</FONT>                    return x;<a name="line.1276"></a>
<FONT color="green">1277</FONT>                }<a name="line.1277"></a>
<FONT color="green">1278</FONT>    <a name="line.1278"></a>
<FONT color="green">1279</FONT>                if (x.nans == INFINITE &amp;&amp; nans == INFINITE &amp;&amp; sign == x.sign) {<a name="line.1279"></a>
<FONT color="green">1280</FONT>                    return x;<a name="line.1280"></a>
<FONT color="green">1281</FONT>                }<a name="line.1281"></a>
<FONT color="green">1282</FONT>    <a name="line.1282"></a>
<FONT color="green">1283</FONT>                if (x.nans == INFINITE &amp;&amp; nans == INFINITE &amp;&amp; sign != x.sign) {<a name="line.1283"></a>
<FONT color="green">1284</FONT>                    field.setIEEEFlagsBits(DfpField.FLAG_INVALID);<a name="line.1284"></a>
<FONT color="green">1285</FONT>                    Dfp result = newInstance(getZero());<a name="line.1285"></a>
<FONT color="green">1286</FONT>                    result.nans = QNAN;<a name="line.1286"></a>
<FONT color="green">1287</FONT>                    result = dotrap(DfpField.FLAG_INVALID, ADD_TRAP, x, result);<a name="line.1287"></a>
<FONT color="green">1288</FONT>                    return result;<a name="line.1288"></a>
<FONT color="green">1289</FONT>                }<a name="line.1289"></a>
<FONT color="green">1290</FONT>            }<a name="line.1290"></a>
<FONT color="green">1291</FONT>    <a name="line.1291"></a>
<FONT color="green">1292</FONT>            /* copy this and the arg */<a name="line.1292"></a>
<FONT color="green">1293</FONT>            Dfp a = newInstance(this);<a name="line.1293"></a>
<FONT color="green">1294</FONT>            Dfp b = newInstance(x);<a name="line.1294"></a>
<FONT color="green">1295</FONT>    <a name="line.1295"></a>
<FONT color="green">1296</FONT>            /* initialize the result object */<a name="line.1296"></a>
<FONT color="green">1297</FONT>            Dfp result = newInstance(getZero());<a name="line.1297"></a>
<FONT color="green">1298</FONT>    <a name="line.1298"></a>
<FONT color="green">1299</FONT>            /* Make all numbers positive, but remember their sign */<a name="line.1299"></a>
<FONT color="green">1300</FONT>            final byte asign = a.sign;<a name="line.1300"></a>
<FONT color="green">1301</FONT>            final byte bsign = b.sign;<a name="line.1301"></a>
<FONT color="green">1302</FONT>    <a name="line.1302"></a>
<FONT color="green">1303</FONT>            a.sign = 1;<a name="line.1303"></a>
<FONT color="green">1304</FONT>            b.sign = 1;<a name="line.1304"></a>
<FONT color="green">1305</FONT>    <a name="line.1305"></a>
<FONT color="green">1306</FONT>            /* The result will be signed like the arg with greatest magnitude */<a name="line.1306"></a>
<FONT color="green">1307</FONT>            byte rsign = bsign;<a name="line.1307"></a>
<FONT color="green">1308</FONT>            if (compare(a, b) &gt; 0) {<a name="line.1308"></a>
<FONT color="green">1309</FONT>                rsign = asign;<a name="line.1309"></a>
<FONT color="green">1310</FONT>            }<a name="line.1310"></a>
<FONT color="green">1311</FONT>    <a name="line.1311"></a>
<FONT color="green">1312</FONT>            /* Handle special case when a or b is zero, by setting the exponent<a name="line.1312"></a>
<FONT color="green">1313</FONT>           of the zero number equal to the other one.  This avoids an alignment<a name="line.1313"></a>
<FONT color="green">1314</FONT>           which would cause catastropic loss of precision */<a name="line.1314"></a>
<FONT color="green">1315</FONT>            if (b.mant[mant.length-1] == 0) {<a name="line.1315"></a>
<FONT color="green">1316</FONT>                b.exp = a.exp;<a name="line.1316"></a>
<FONT color="green">1317</FONT>            }<a name="line.1317"></a>
<FONT color="green">1318</FONT>    <a name="line.1318"></a>
<FONT color="green">1319</FONT>            if (a.mant[mant.length-1] == 0) {<a name="line.1319"></a>
<FONT color="green">1320</FONT>                a.exp = b.exp;<a name="line.1320"></a>
<FONT color="green">1321</FONT>            }<a name="line.1321"></a>
<FONT color="green">1322</FONT>    <a name="line.1322"></a>
<FONT color="green">1323</FONT>            /* align number with the smaller exponent */<a name="line.1323"></a>
<FONT color="green">1324</FONT>            int aextradigit = 0;<a name="line.1324"></a>
<FONT color="green">1325</FONT>            int bextradigit = 0;<a name="line.1325"></a>
<FONT color="green">1326</FONT>            if (a.exp &lt; b.exp) {<a name="line.1326"></a>
<FONT color="green">1327</FONT>                aextradigit = a.align(b.exp);<a name="line.1327"></a>
<FONT color="green">1328</FONT>            } else {<a name="line.1328"></a>
<FONT color="green">1329</FONT>                bextradigit = b.align(a.exp);<a name="line.1329"></a>
<FONT color="green">1330</FONT>            }<a name="line.1330"></a>
<FONT color="green">1331</FONT>    <a name="line.1331"></a>
<FONT color="green">1332</FONT>            /* complement the smaller of the two if the signs are different */<a name="line.1332"></a>
<FONT color="green">1333</FONT>            if (asign != bsign) {<a name="line.1333"></a>
<FONT color="green">1334</FONT>                if (asign == rsign) {<a name="line.1334"></a>
<FONT color="green">1335</FONT>                    bextradigit = b.complement(bextradigit);<a name="line.1335"></a>
<FONT color="green">1336</FONT>                } else {<a name="line.1336"></a>
<FONT color="green">1337</FONT>                    aextradigit = a.complement(aextradigit);<a name="line.1337"></a>
<FONT color="green">1338</FONT>                }<a name="line.1338"></a>
<FONT color="green">1339</FONT>            }<a name="line.1339"></a>
<FONT color="green">1340</FONT>    <a name="line.1340"></a>
<FONT color="green">1341</FONT>            /* add the mantissas */<a name="line.1341"></a>
<FONT color="green">1342</FONT>            int rh = 0; /* acts as a carry */<a name="line.1342"></a>
<FONT color="green">1343</FONT>            for (int i = 0; i &lt; mant.length; i++) {<a name="line.1343"></a>
<FONT color="green">1344</FONT>                final int r = a.mant[i]+b.mant[i]+rh;<a name="line.1344"></a>
<FONT color="green">1345</FONT>                rh = r / RADIX;<a name="line.1345"></a>
<FONT color="green">1346</FONT>                result.mant[i] = r - rh * RADIX;<a name="line.1346"></a>
<FONT color="green">1347</FONT>            }<a name="line.1347"></a>
<FONT color="green">1348</FONT>            result.exp = a.exp;<a name="line.1348"></a>
<FONT color="green">1349</FONT>            result.sign = rsign;<a name="line.1349"></a>
<FONT color="green">1350</FONT>    <a name="line.1350"></a>
<FONT color="green">1351</FONT>            /* handle overflow -- note, when asign!=bsign an overflow is<a name="line.1351"></a>
<FONT color="green">1352</FONT>             * normal and should be ignored.  */<a name="line.1352"></a>
<FONT color="green">1353</FONT>    <a name="line.1353"></a>
<FONT color="green">1354</FONT>            if (rh != 0 &amp;&amp; (asign == bsign)) {<a name="line.1354"></a>
<FONT color="green">1355</FONT>                final int lostdigit = result.mant[0];<a name="line.1355"></a>
<FONT color="green">1356</FONT>                result.shiftRight();<a name="line.1356"></a>
<FONT color="green">1357</FONT>                result.mant[mant.length-1] = rh;<a name="line.1357"></a>
<FONT color="green">1358</FONT>                final int excp = result.round(lostdigit);<a name="line.1358"></a>
<FONT color="green">1359</FONT>                if (excp != 0) {<a name="line.1359"></a>
<FONT color="green">1360</FONT>                    result = dotrap(excp, ADD_TRAP, x, result);<a name="line.1360"></a>
<FONT color="green">1361</FONT>                }<a name="line.1361"></a>
<FONT color="green">1362</FONT>            }<a name="line.1362"></a>
<FONT color="green">1363</FONT>    <a name="line.1363"></a>
<FONT color="green">1364</FONT>            /* normalize the result */<a name="line.1364"></a>
<FONT color="green">1365</FONT>            for (int i = 0; i &lt; mant.length; i++) {<a name="line.1365"></a>
<FONT color="green">1366</FONT>                if (result.mant[mant.length-1] != 0) {<a name="line.1366"></a>
<FONT color="green">1367</FONT>                    break;<a name="line.1367"></a>
<FONT color="green">1368</FONT>                }<a name="line.1368"></a>
<FONT color="green">1369</FONT>                result.shiftLeft();<a name="line.1369"></a>
<FONT color="green">1370</FONT>                if (i == 0) {<a name="line.1370"></a>
<FONT color="green">1371</FONT>                    result.mant[0] = aextradigit+bextradigit;<a name="line.1371"></a>
<FONT color="green">1372</FONT>                    aextradigit = 0;<a name="line.1372"></a>
<FONT color="green">1373</FONT>                    bextradigit = 0;<a name="line.1373"></a>
<FONT color="green">1374</FONT>                }<a name="line.1374"></a>
<FONT color="green">1375</FONT>            }<a name="line.1375"></a>
<FONT color="green">1376</FONT>    <a name="line.1376"></a>
<FONT color="green">1377</FONT>            /* result is zero if after normalization the most sig. digit is zero */<a name="line.1377"></a>
<FONT color="green">1378</FONT>            if (result.mant[mant.length-1] == 0) {<a name="line.1378"></a>
<FONT color="green">1379</FONT>                result.exp = 0;<a name="line.1379"></a>
<FONT color="green">1380</FONT>    <a name="line.1380"></a>
<FONT color="green">1381</FONT>                if (asign != bsign) {<a name="line.1381"></a>
<FONT color="green">1382</FONT>                    // Unless adding 2 negative zeros, sign is positive<a name="line.1382"></a>
<FONT color="green">1383</FONT>                    result.sign = 1;  // Per IEEE 854-1987 Section 6.3<a name="line.1383"></a>
<FONT color="green">1384</FONT>                }<a name="line.1384"></a>
<FONT color="green">1385</FONT>            }<a name="line.1385"></a>
<FONT color="green">1386</FONT>    <a name="line.1386"></a>
<FONT color="green">1387</FONT>            /* Call round to test for over/under flows */<a name="line.1387"></a>
<FONT color="green">1388</FONT>            final int excp = result.round(aextradigit + bextradigit);<a name="line.1388"></a>
<FONT color="green">1389</FONT>            if (excp != 0) {<a name="line.1389"></a>
<FONT color="green">1390</FONT>                result = dotrap(excp, ADD_TRAP, x, result);<a name="line.1390"></a>
<FONT color="green">1391</FONT>            }<a name="line.1391"></a>
<FONT color="green">1392</FONT>    <a name="line.1392"></a>
<FONT color="green">1393</FONT>            return result;<a name="line.1393"></a>
<FONT color="green">1394</FONT>        }<a name="line.1394"></a>
<FONT color="green">1395</FONT>    <a name="line.1395"></a>
<FONT color="green">1396</FONT>        /** Returns a number that is this number with the sign bit reversed.<a name="line.1396"></a>
<FONT color="green">1397</FONT>         * @return the opposite of this<a name="line.1397"></a>
<FONT color="green">1398</FONT>         */<a name="line.1398"></a>
<FONT color="green">1399</FONT>        public Dfp negate() {<a name="line.1399"></a>
<FONT color="green">1400</FONT>            Dfp result = newInstance(this);<a name="line.1400"></a>
<FONT color="green">1401</FONT>            result.sign = (byte) - result.sign;<a name="line.1401"></a>
<FONT color="green">1402</FONT>            return result;<a name="line.1402"></a>
<FONT color="green">1403</FONT>        }<a name="line.1403"></a>
<FONT color="green">1404</FONT>    <a name="line.1404"></a>
<FONT color="green">1405</FONT>        /** Subtract x from this.<a name="line.1405"></a>
<FONT color="green">1406</FONT>         * @param x number to subtract<a name="line.1406"></a>
<FONT color="green">1407</FONT>         * @return difference of this and a<a name="line.1407"></a>
<FONT color="green">1408</FONT>         */<a name="line.1408"></a>
<FONT color="green">1409</FONT>        public Dfp subtract(final Dfp x) {<a name="line.1409"></a>
<FONT color="green">1410</FONT>            return add(x.negate());<a name="line.1410"></a>
<FONT color="green">1411</FONT>        }<a name="line.1411"></a>
<FONT color="green">1412</FONT>    <a name="line.1412"></a>
<FONT color="green">1413</FONT>        /** Round this given the next digit n using the current rounding mode.<a name="line.1413"></a>
<FONT color="green">1414</FONT>         * @param n ???<a name="line.1414"></a>
<FONT color="green">1415</FONT>         * @return the IEEE flag if an exception occurred<a name="line.1415"></a>
<FONT color="green">1416</FONT>         */<a name="line.1416"></a>
<FONT color="green">1417</FONT>        protected int round(int n) {<a name="line.1417"></a>
<FONT color="green">1418</FONT>            boolean inc = false;<a name="line.1418"></a>
<FONT color="green">1419</FONT>            switch (field.getRoundingMode()) {<a name="line.1419"></a>
<FONT color="green">1420</FONT>                case ROUND_DOWN:<a name="line.1420"></a>
<FONT color="green">1421</FONT>                    inc = false;<a name="line.1421"></a>
<FONT color="green">1422</FONT>                    break;<a name="line.1422"></a>
<FONT color="green">1423</FONT>    <a name="line.1423"></a>
<FONT color="green">1424</FONT>                case ROUND_UP:<a name="line.1424"></a>
<FONT color="green">1425</FONT>                    inc = n != 0;       // round up if n!=0<a name="line.1425"></a>
<FONT color="green">1426</FONT>                    break;<a name="line.1426"></a>
<FONT color="green">1427</FONT>    <a name="line.1427"></a>
<FONT color="green">1428</FONT>                case ROUND_HALF_UP:<a name="line.1428"></a>
<FONT color="green">1429</FONT>                    inc = n &gt;= 5000;  // round half up<a name="line.1429"></a>
<FONT color="green">1430</FONT>                    break;<a name="line.1430"></a>
<FONT color="green">1431</FONT>    <a name="line.1431"></a>
<FONT color="green">1432</FONT>                case ROUND_HALF_DOWN:<a name="line.1432"></a>
<FONT color="green">1433</FONT>                    inc = n &gt; 5000;  // round half down<a name="line.1433"></a>
<FONT color="green">1434</FONT>                    break;<a name="line.1434"></a>
<FONT color="green">1435</FONT>    <a name="line.1435"></a>
<FONT color="green">1436</FONT>                case ROUND_HALF_EVEN:<a name="line.1436"></a>
<FONT color="green">1437</FONT>                    inc = n &gt; 5000 || (n == 5000 &amp;&amp; (mant[0] &amp; 1) == 1);  // round half-even<a name="line.1437"></a>
<FONT color="green">1438</FONT>                    break;<a name="line.1438"></a>
<FONT color="green">1439</FONT>    <a name="line.1439"></a>
<FONT color="green">1440</FONT>                case ROUND_HALF_ODD:<a name="line.1440"></a>
<FONT color="green">1441</FONT>                    inc = n &gt; 5000 || (n == 5000 &amp;&amp; (mant[0] &amp; 1) == 0);  // round half-odd<a name="line.1441"></a>
<FONT color="green">1442</FONT>                    break;<a name="line.1442"></a>
<FONT color="green">1443</FONT>    <a name="line.1443"></a>
<FONT color="green">1444</FONT>                case ROUND_CEIL:<a name="line.1444"></a>
<FONT color="green">1445</FONT>                    inc = sign == 1 &amp;&amp; n != 0;  // round ceil<a name="line.1445"></a>
<FONT color="green">1446</FONT>                    break;<a name="line.1446"></a>
<FONT color="green">1447</FONT>    <a name="line.1447"></a>
<FONT color="green">1448</FONT>                case ROUND_FLOOR:<a name="line.1448"></a>
<FONT color="green">1449</FONT>                default:<a name="line.1449"></a>
<FONT color="green">1450</FONT>                    inc = sign == -1 &amp;&amp; n != 0;  // round floor<a name="line.1450"></a>
<FONT color="green">1451</FONT>                    break;<a name="line.1451"></a>
<FONT color="green">1452</FONT>            }<a name="line.1452"></a>
<FONT color="green">1453</FONT>    <a name="line.1453"></a>
<FONT color="green">1454</FONT>            if (inc) {<a name="line.1454"></a>
<FONT color="green">1455</FONT>                // increment if necessary<a name="line.1455"></a>
<FONT color="green">1456</FONT>                int rh = 1;<a name="line.1456"></a>
<FONT color="green">1457</FONT>                for (int i = 0; i &lt; mant.length; i++) {<a name="line.1457"></a>
<FONT color="green">1458</FONT>                    final int r = mant[i] + rh;<a name="line.1458"></a>
<FONT color="green">1459</FONT>                    rh = r / RADIX;<a name="line.1459"></a>
<FONT color="green">1460</FONT>                    mant[i] = r - rh * RADIX;<a name="line.1460"></a>
<FONT color="green">1461</FONT>                }<a name="line.1461"></a>
<FONT color="green">1462</FONT>    <a name="line.1462"></a>
<FONT color="green">1463</FONT>                if (rh != 0) {<a name="line.1463"></a>
<FONT color="green">1464</FONT>                    shiftRight();<a name="line.1464"></a>
<FONT color="green">1465</FONT>                    mant[mant.length-1] = rh;<a name="line.1465"></a>
<FONT color="green">1466</FONT>                }<a name="line.1466"></a>
<FONT color="green">1467</FONT>            }<a name="line.1467"></a>
<FONT color="green">1468</FONT>    <a name="line.1468"></a>
<FONT color="green">1469</FONT>            // check for exceptional cases and raise signals if necessary<a name="line.1469"></a>
<FONT color="green">1470</FONT>            if (exp &lt; MIN_EXP) {<a name="line.1470"></a>
<FONT color="green">1471</FONT>                // Gradual Underflow<a name="line.1471"></a>
<FONT color="green">1472</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_UNDERFLOW);<a name="line.1472"></a>
<FONT color="green">1473</FONT>                return DfpField.FLAG_UNDERFLOW;<a name="line.1473"></a>
<FONT color="green">1474</FONT>            }<a name="line.1474"></a>
<FONT color="green">1475</FONT>    <a name="line.1475"></a>
<FONT color="green">1476</FONT>            if (exp &gt; MAX_EXP) {<a name="line.1476"></a>
<FONT color="green">1477</FONT>                // Overflow<a name="line.1477"></a>
<FONT color="green">1478</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_OVERFLOW);<a name="line.1478"></a>
<FONT color="green">1479</FONT>                return DfpField.FLAG_OVERFLOW;<a name="line.1479"></a>
<FONT color="green">1480</FONT>            }<a name="line.1480"></a>
<FONT color="green">1481</FONT>    <a name="line.1481"></a>
<FONT color="green">1482</FONT>            if (n != 0) {<a name="line.1482"></a>
<FONT color="green">1483</FONT>                // Inexact<a name="line.1483"></a>
<FONT color="green">1484</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INEXACT);<a name="line.1484"></a>
<FONT color="green">1485</FONT>                return DfpField.FLAG_INEXACT;<a name="line.1485"></a>
<FONT color="green">1486</FONT>            }<a name="line.1486"></a>
<FONT color="green">1487</FONT>    <a name="line.1487"></a>
<FONT color="green">1488</FONT>            return 0;<a name="line.1488"></a>
<FONT color="green">1489</FONT>    <a name="line.1489"></a>
<FONT color="green">1490</FONT>        }<a name="line.1490"></a>
<FONT color="green">1491</FONT>    <a name="line.1491"></a>
<FONT color="green">1492</FONT>        /** Multiply this by x.<a name="line.1492"></a>
<FONT color="green">1493</FONT>         * @param x multiplicand<a name="line.1493"></a>
<FONT color="green">1494</FONT>         * @return product of this and x<a name="line.1494"></a>
<FONT color="green">1495</FONT>         */<a name="line.1495"></a>
<FONT color="green">1496</FONT>        public Dfp multiply(final Dfp x) {<a name="line.1496"></a>
<FONT color="green">1497</FONT>    <a name="line.1497"></a>
<FONT color="green">1498</FONT>            // make sure we don't mix number with different precision<a name="line.1498"></a>
<FONT color="green">1499</FONT>            if (field.getRadixDigits() != x.field.getRadixDigits()) {<a name="line.1499"></a>
<FONT color="green">1500</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INVALID);<a name="line.1500"></a>
<FONT color="green">1501</FONT>                final Dfp result = newInstance(getZero());<a name="line.1501"></a>
<FONT color="green">1502</FONT>                result.nans = QNAN;<a name="line.1502"></a>
<FONT color="green">1503</FONT>                return dotrap(DfpField.FLAG_INVALID, MULTIPLY_TRAP, x, result);<a name="line.1503"></a>
<FONT color="green">1504</FONT>            }<a name="line.1504"></a>
<FONT color="green">1505</FONT>    <a name="line.1505"></a>
<FONT color="green">1506</FONT>            Dfp result = newInstance(getZero());<a name="line.1506"></a>
<FONT color="green">1507</FONT>    <a name="line.1507"></a>
<FONT color="green">1508</FONT>            /* handle special cases */<a name="line.1508"></a>
<FONT color="green">1509</FONT>            if (nans != FINITE || x.nans != FINITE) {<a name="line.1509"></a>
<FONT color="green">1510</FONT>                if (isNaN()) {<a name="line.1510"></a>
<FONT color="green">1511</FONT>                    return this;<a name="line.1511"></a>
<FONT color="green">1512</FONT>                }<a name="line.1512"></a>
<FONT color="green">1513</FONT>    <a name="line.1513"></a>
<FONT color="green">1514</FONT>                if (x.isNaN()) {<a name="line.1514"></a>
<FONT color="green">1515</FONT>                    return x;<a name="line.1515"></a>
<FONT color="green">1516</FONT>                }<a name="line.1516"></a>
<FONT color="green">1517</FONT>    <a name="line.1517"></a>
<FONT color="green">1518</FONT>                if (nans == INFINITE &amp;&amp; x.nans == FINITE &amp;&amp; x.mant[mant.length-1] != 0) {<a name="line.1518"></a>
<FONT color="green">1519</FONT>                    result = newInstance(this);<a name="line.1519"></a>
<FONT color="green">1520</FONT>                    result.sign = (byte) (sign * x.sign);<a name="line.1520"></a>
<FONT color="green">1521</FONT>                    return result;<a name="line.1521"></a>
<FONT color="green">1522</FONT>                }<a name="line.1522"></a>
<FONT color="green">1523</FONT>    <a name="line.1523"></a>
<FONT color="green">1524</FONT>                if (x.nans == INFINITE &amp;&amp; nans == FINITE &amp;&amp; mant[mant.length-1] != 0) {<a name="line.1524"></a>
<FONT color="green">1525</FONT>                    result = newInstance(x);<a name="line.1525"></a>
<FONT color="green">1526</FONT>                    result.sign = (byte) (sign * x.sign);<a name="line.1526"></a>
<FONT color="green">1527</FONT>                    return result;<a name="line.1527"></a>
<FONT color="green">1528</FONT>                }<a name="line.1528"></a>
<FONT color="green">1529</FONT>    <a name="line.1529"></a>
<FONT color="green">1530</FONT>                if (x.nans == INFINITE &amp;&amp; nans == INFINITE) {<a name="line.1530"></a>
<FONT color="green">1531</FONT>                    result = newInstance(this);<a name="line.1531"></a>
<FONT color="green">1532</FONT>                    result.sign = (byte) (sign * x.sign);<a name="line.1532"></a>
<FONT color="green">1533</FONT>                    return result;<a name="line.1533"></a>
<FONT color="green">1534</FONT>                }<a name="line.1534"></a>
<FONT color="green">1535</FONT>    <a name="line.1535"></a>
<FONT color="green">1536</FONT>                if ( (x.nans == INFINITE &amp;&amp; nans == FINITE &amp;&amp; mant[mant.length-1] == 0) ||<a name="line.1536"></a>
<FONT color="green">1537</FONT>                        (nans == INFINITE &amp;&amp; x.nans == FINITE &amp;&amp; x.mant[mant.length-1] == 0) ) {<a name="line.1537"></a>
<FONT color="green">1538</FONT>                    field.setIEEEFlagsBits(DfpField.FLAG_INVALID);<a name="line.1538"></a>
<FONT color="green">1539</FONT>                    result = newInstance(getZero());<a name="line.1539"></a>
<FONT color="green">1540</FONT>                    result.nans = QNAN;<a name="line.1540"></a>
<FONT color="green">1541</FONT>                    result = dotrap(DfpField.FLAG_INVALID, MULTIPLY_TRAP, x, result);<a name="line.1541"></a>
<FONT color="green">1542</FONT>                    return result;<a name="line.1542"></a>
<FONT color="green">1543</FONT>                }<a name="line.1543"></a>
<FONT color="green">1544</FONT>            }<a name="line.1544"></a>
<FONT color="green">1545</FONT>    <a name="line.1545"></a>
<FONT color="green">1546</FONT>            int[] product = new int[mant.length*2];  // Big enough to hold even the largest result<a name="line.1546"></a>
<FONT color="green">1547</FONT>    <a name="line.1547"></a>
<FONT color="green">1548</FONT>            for (int i = 0; i &lt; mant.length; i++) {<a name="line.1548"></a>
<FONT color="green">1549</FONT>                int rh = 0;  // acts as a carry<a name="line.1549"></a>
<FONT color="green">1550</FONT>                for (int j=0; j&lt;mant.length; j++) {<a name="line.1550"></a>
<FONT color="green">1551</FONT>                    int r = mant[i] * x.mant[j];    // multiply the 2 digits<a name="line.1551"></a>
<FONT color="green">1552</FONT>                    r = r + product[i+j] + rh;  // add to the product digit with carry in<a name="line.1552"></a>
<FONT color="green">1553</FONT>    <a name="line.1553"></a>
<FONT color="green">1554</FONT>                    rh = r / RADIX;<a name="line.1554"></a>
<FONT color="green">1555</FONT>                    product[i+j] = r - rh * RADIX;<a name="line.1555"></a>
<FONT color="green">1556</FONT>                }<a name="line.1556"></a>
<FONT color="green">1557</FONT>                product[i+mant.length] = rh;<a name="line.1557"></a>
<FONT color="green">1558</FONT>            }<a name="line.1558"></a>
<FONT color="green">1559</FONT>    <a name="line.1559"></a>
<FONT color="green">1560</FONT>            // Find the most sig digit<a name="line.1560"></a>
<FONT color="green">1561</FONT>            int md = mant.length * 2 - 1;  // default, in case result is zero<a name="line.1561"></a>
<FONT color="green">1562</FONT>            for (int i = mant.length * 2 - 1; i &gt;= 0; i--) {<a name="line.1562"></a>
<FONT color="green">1563</FONT>                if (product[i] != 0) {<a name="line.1563"></a>
<FONT color="green">1564</FONT>                    md = i;<a name="line.1564"></a>
<FONT color="green">1565</FONT>                    break;<a name="line.1565"></a>
<FONT color="green">1566</FONT>                }<a name="line.1566"></a>
<FONT color="green">1567</FONT>            }<a name="line.1567"></a>
<FONT color="green">1568</FONT>    <a name="line.1568"></a>
<FONT color="green">1569</FONT>            // Copy the digits into the result<a name="line.1569"></a>
<FONT color="green">1570</FONT>            for (int i = 0; i &lt; mant.length; i++) {<a name="line.1570"></a>
<FONT color="green">1571</FONT>                result.mant[mant.length - i - 1] = product[md - i];<a name="line.1571"></a>
<FONT color="green">1572</FONT>            }<a name="line.1572"></a>
<FONT color="green">1573</FONT>    <a name="line.1573"></a>
<FONT color="green">1574</FONT>            // Fixup the exponent.<a name="line.1574"></a>
<FONT color="green">1575</FONT>            result.exp = exp + x.exp + md - 2 * mant.length + 1;<a name="line.1575"></a>
<FONT color="green">1576</FONT>            result.sign = (byte)((sign == x.sign)?1:-1);<a name="line.1576"></a>
<FONT color="green">1577</FONT>    <a name="line.1577"></a>
<FONT color="green">1578</FONT>            if (result.mant[mant.length-1] == 0) {<a name="line.1578"></a>
<FONT color="green">1579</FONT>                // if result is zero, set exp to zero<a name="line.1579"></a>
<FONT color="green">1580</FONT>                result.exp = 0;<a name="line.1580"></a>
<FONT color="green">1581</FONT>            }<a name="line.1581"></a>
<FONT color="green">1582</FONT>    <a name="line.1582"></a>
<FONT color="green">1583</FONT>            final int excp;<a name="line.1583"></a>
<FONT color="green">1584</FONT>            if (md &gt; (mant.length-1)) {<a name="line.1584"></a>
<FONT color="green">1585</FONT>                excp = result.round(product[md-mant.length]);<a name="line.1585"></a>
<FONT color="green">1586</FONT>            } else {<a name="line.1586"></a>
<FONT color="green">1587</FONT>                excp = result.round(0); // has no effect except to check status<a name="line.1587"></a>
<FONT color="green">1588</FONT>            }<a name="line.1588"></a>
<FONT color="green">1589</FONT>    <a name="line.1589"></a>
<FONT color="green">1590</FONT>            if (excp != 0) {<a name="line.1590"></a>
<FONT color="green">1591</FONT>                result = dotrap(excp, MULTIPLY_TRAP, x, result);<a name="line.1591"></a>
<FONT color="green">1592</FONT>            }<a name="line.1592"></a>
<FONT color="green">1593</FONT>    <a name="line.1593"></a>
<FONT color="green">1594</FONT>            return result;<a name="line.1594"></a>
<FONT color="green">1595</FONT>    <a name="line.1595"></a>
<FONT color="green">1596</FONT>        }<a name="line.1596"></a>
<FONT color="green">1597</FONT>    <a name="line.1597"></a>
<FONT color="green">1598</FONT>        /** Multiply this by a single digit x.<a name="line.1598"></a>
<FONT color="green">1599</FONT>         * @param x multiplicand<a name="line.1599"></a>
<FONT color="green">1600</FONT>         * @return product of this and x<a name="line.1600"></a>
<FONT color="green">1601</FONT>         */<a name="line.1601"></a>
<FONT color="green">1602</FONT>        public Dfp multiply(final int x) {<a name="line.1602"></a>
<FONT color="green">1603</FONT>            if (x &gt;= 0 &amp;&amp; x &lt; RADIX) {<a name="line.1603"></a>
<FONT color="green">1604</FONT>                return multiplyFast(x);<a name="line.1604"></a>
<FONT color="green">1605</FONT>            } else {<a name="line.1605"></a>
<FONT color="green">1606</FONT>                return multiply(newInstance(x));<a name="line.1606"></a>
<FONT color="green">1607</FONT>            }<a name="line.1607"></a>
<FONT color="green">1608</FONT>        }<a name="line.1608"></a>
<FONT color="green">1609</FONT>    <a name="line.1609"></a>
<FONT color="green">1610</FONT>        /** Multiply this by a single digit 0&amp;lt;=x&amp;lt;radix.<a name="line.1610"></a>
<FONT color="green">1611</FONT>         * There are speed advantages in this special case.<a name="line.1611"></a>
<FONT color="green">1612</FONT>         * @param x multiplicand<a name="line.1612"></a>
<FONT color="green">1613</FONT>         * @return product of this and x<a name="line.1613"></a>
<FONT color="green">1614</FONT>         */<a name="line.1614"></a>
<FONT color="green">1615</FONT>        private Dfp multiplyFast(final int x) {<a name="line.1615"></a>
<FONT color="green">1616</FONT>            Dfp result = newInstance(this);<a name="line.1616"></a>
<FONT color="green">1617</FONT>    <a name="line.1617"></a>
<FONT color="green">1618</FONT>            /* handle special cases */<a name="line.1618"></a>
<FONT color="green">1619</FONT>            if (nans != FINITE) {<a name="line.1619"></a>
<FONT color="green">1620</FONT>                if (isNaN()) {<a name="line.1620"></a>
<FONT color="green">1621</FONT>                    return this;<a name="line.1621"></a>
<FONT color="green">1622</FONT>                }<a name="line.1622"></a>
<FONT color="green">1623</FONT>    <a name="line.1623"></a>
<FONT color="green">1624</FONT>                if (nans == INFINITE &amp;&amp; x != 0) {<a name="line.1624"></a>
<FONT color="green">1625</FONT>                    result = newInstance(this);<a name="line.1625"></a>
<FONT color="green">1626</FONT>                    return result;<a name="line.1626"></a>
<FONT color="green">1627</FONT>                }<a name="line.1627"></a>
<FONT color="green">1628</FONT>    <a name="line.1628"></a>
<FONT color="green">1629</FONT>                if (nans == INFINITE &amp;&amp; x == 0) {<a name="line.1629"></a>
<FONT color="green">1630</FONT>                    field.setIEEEFlagsBits(DfpField.FLAG_INVALID);<a name="line.1630"></a>
<FONT color="green">1631</FONT>                    result = newInstance(getZero());<a name="line.1631"></a>
<FONT color="green">1632</FONT>                    result.nans = QNAN;<a name="line.1632"></a>
<FONT color="green">1633</FONT>                    result = dotrap(DfpField.FLAG_INVALID, MULTIPLY_TRAP, newInstance(getZero()), result);<a name="line.1633"></a>
<FONT color="green">1634</FONT>                    return result;<a name="line.1634"></a>
<FONT color="green">1635</FONT>                }<a name="line.1635"></a>
<FONT color="green">1636</FONT>            }<a name="line.1636"></a>
<FONT color="green">1637</FONT>    <a name="line.1637"></a>
<FONT color="green">1638</FONT>            /* range check x */<a name="line.1638"></a>
<FONT color="green">1639</FONT>            if (x &lt; 0 || x &gt;= RADIX) {<a name="line.1639"></a>
<FONT color="green">1640</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INVALID);<a name="line.1640"></a>
<FONT color="green">1641</FONT>                result = newInstance(getZero());<a name="line.1641"></a>
<FONT color="green">1642</FONT>                result.nans = QNAN;<a name="line.1642"></a>
<FONT color="green">1643</FONT>                result = dotrap(DfpField.FLAG_INVALID, MULTIPLY_TRAP, result, result);<a name="line.1643"></a>
<FONT color="green">1644</FONT>                return result;<a name="line.1644"></a>
<FONT color="green">1645</FONT>            }<a name="line.1645"></a>
<FONT color="green">1646</FONT>    <a name="line.1646"></a>
<FONT color="green">1647</FONT>            int rh = 0;<a name="line.1647"></a>
<FONT color="green">1648</FONT>            for (int i = 0; i &lt; mant.length; i++) {<a name="line.1648"></a>
<FONT color="green">1649</FONT>                final int r = mant[i] * x + rh;<a name="line.1649"></a>
<FONT color="green">1650</FONT>                rh = r / RADIX;<a name="line.1650"></a>
<FONT color="green">1651</FONT>                result.mant[i] = r - rh * RADIX;<a name="line.1651"></a>
<FONT color="green">1652</FONT>            }<a name="line.1652"></a>
<FONT color="green">1653</FONT>    <a name="line.1653"></a>
<FONT color="green">1654</FONT>            int lostdigit = 0;<a name="line.1654"></a>
<FONT color="green">1655</FONT>            if (rh != 0) {<a name="line.1655"></a>
<FONT color="green">1656</FONT>                lostdigit = result.mant[0];<a name="line.1656"></a>
<FONT color="green">1657</FONT>                result.shiftRight();<a name="line.1657"></a>
<FONT color="green">1658</FONT>                result.mant[mant.length-1] = rh;<a name="line.1658"></a>
<FONT color="green">1659</FONT>            }<a name="line.1659"></a>
<FONT color="green">1660</FONT>    <a name="line.1660"></a>
<FONT color="green">1661</FONT>            if (result.mant[mant.length-1] == 0) { // if result is zero, set exp to zero<a name="line.1661"></a>
<FONT color="green">1662</FONT>                result.exp = 0;<a name="line.1662"></a>
<FONT color="green">1663</FONT>            }<a name="line.1663"></a>
<FONT color="green">1664</FONT>    <a name="line.1664"></a>
<FONT color="green">1665</FONT>            final int excp = result.round(lostdigit);<a name="line.1665"></a>
<FONT color="green">1666</FONT>            if (excp != 0) {<a name="line.1666"></a>
<FONT color="green">1667</FONT>                result = dotrap(excp, MULTIPLY_TRAP, result, result);<a name="line.1667"></a>
<FONT color="green">1668</FONT>            }<a name="line.1668"></a>
<FONT color="green">1669</FONT>    <a name="line.1669"></a>
<FONT color="green">1670</FONT>            return result;<a name="line.1670"></a>
<FONT color="green">1671</FONT>        }<a name="line.1671"></a>
<FONT color="green">1672</FONT>    <a name="line.1672"></a>
<FONT color="green">1673</FONT>        /** Divide this by divisor.<a name="line.1673"></a>
<FONT color="green">1674</FONT>         * @param divisor divisor<a name="line.1674"></a>
<FONT color="green">1675</FONT>         * @return quotient of this by divisor<a name="line.1675"></a>
<FONT color="green">1676</FONT>         */<a name="line.1676"></a>
<FONT color="green">1677</FONT>        public Dfp divide(Dfp divisor) {<a name="line.1677"></a>
<FONT color="green">1678</FONT>            int dividend[]; // current status of the dividend<a name="line.1678"></a>
<FONT color="green">1679</FONT>            int quotient[]; // quotient<a name="line.1679"></a>
<FONT color="green">1680</FONT>            int remainder[];// remainder<a name="line.1680"></a>
<FONT color="green">1681</FONT>            int qd;         // current quotient digit we're working with<a name="line.1681"></a>
<FONT color="green">1682</FONT>            int nsqd;       // number of significant quotient digits we have<a name="line.1682"></a>
<FONT color="green">1683</FONT>            int trial=0;    // trial quotient digit<a name="line.1683"></a>
<FONT color="green">1684</FONT>            int minadj;     // minimum adjustment<a name="line.1684"></a>
<FONT color="green">1685</FONT>            boolean trialgood; // Flag to indicate a good trail digit<a name="line.1685"></a>
<FONT color="green">1686</FONT>            int md=0;       // most sig digit in result<a name="line.1686"></a>
<FONT color="green">1687</FONT>            int excp;       // exceptions<a name="line.1687"></a>
<FONT color="green">1688</FONT>    <a name="line.1688"></a>
<FONT color="green">1689</FONT>            // make sure we don't mix number with different precision<a name="line.1689"></a>
<FONT color="green">1690</FONT>            if (field.getRadixDigits() != divisor.field.getRadixDigits()) {<a name="line.1690"></a>
<FONT color="green">1691</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INVALID);<a name="line.1691"></a>
<FONT color="green">1692</FONT>                final Dfp result = newInstance(getZero());<a name="line.1692"></a>
<FONT color="green">1693</FONT>                result.nans = QNAN;<a name="line.1693"></a>
<FONT color="green">1694</FONT>                return dotrap(DfpField.FLAG_INVALID, DIVIDE_TRAP, divisor, result);<a name="line.1694"></a>
<FONT color="green">1695</FONT>            }<a name="line.1695"></a>
<FONT color="green">1696</FONT>    <a name="line.1696"></a>
<FONT color="green">1697</FONT>            Dfp result = newInstance(getZero());<a name="line.1697"></a>
<FONT color="green">1698</FONT>    <a name="line.1698"></a>
<FONT color="green">1699</FONT>            /* handle special cases */<a name="line.1699"></a>
<FONT color="green">1700</FONT>            if (nans != FINITE || divisor.nans != FINITE) {<a name="line.1700"></a>
<FONT color="green">1701</FONT>                if (isNaN()) {<a name="line.1701"></a>
<FONT color="green">1702</FONT>                    return this;<a name="line.1702"></a>
<FONT color="green">1703</FONT>                }<a name="line.1703"></a>
<FONT color="green">1704</FONT>    <a name="line.1704"></a>
<FONT color="green">1705</FONT>                if (divisor.isNaN()) {<a name="line.1705"></a>
<FONT color="green">1706</FONT>                    return divisor;<a name="line.1706"></a>
<FONT color="green">1707</FONT>                }<a name="line.1707"></a>
<FONT color="green">1708</FONT>    <a name="line.1708"></a>
<FONT color="green">1709</FONT>                if (nans == INFINITE &amp;&amp; divisor.nans == FINITE) {<a name="line.1709"></a>
<FONT color="green">1710</FONT>                    result = newInstance(this);<a name="line.1710"></a>
<FONT color="green">1711</FONT>                    result.sign = (byte) (sign * divisor.sign);<a name="line.1711"></a>
<FONT color="green">1712</FONT>                    return result;<a name="line.1712"></a>
<FONT color="green">1713</FONT>                }<a name="line.1713"></a>
<FONT color="green">1714</FONT>    <a name="line.1714"></a>
<FONT color="green">1715</FONT>                if (divisor.nans == INFINITE &amp;&amp; nans == FINITE) {<a name="line.1715"></a>
<FONT color="green">1716</FONT>                    result = newInstance(getZero());<a name="line.1716"></a>
<FONT color="green">1717</FONT>                    result.sign = (byte) (sign * divisor.sign);<a name="line.1717"></a>
<FONT color="green">1718</FONT>                    return result;<a name="line.1718"></a>
<FONT color="green">1719</FONT>                }<a name="line.1719"></a>
<FONT color="green">1720</FONT>    <a name="line.1720"></a>
<FONT color="green">1721</FONT>                if (divisor.nans == INFINITE &amp;&amp; nans == INFINITE) {<a name="line.1721"></a>
<FONT color="green">1722</FONT>                    field.setIEEEFlagsBits(DfpField.FLAG_INVALID);<a name="line.1722"></a>
<FONT color="green">1723</FONT>                    result = newInstance(getZero());<a name="line.1723"></a>
<FONT color="green">1724</FONT>                    result.nans = QNAN;<a name="line.1724"></a>
<FONT color="green">1725</FONT>                    result = dotrap(DfpField.FLAG_INVALID, DIVIDE_TRAP, divisor, result);<a name="line.1725"></a>
<FONT color="green">1726</FONT>                    return result;<a name="line.1726"></a>
<FONT color="green">1727</FONT>                }<a name="line.1727"></a>
<FONT color="green">1728</FONT>            }<a name="line.1728"></a>
<FONT color="green">1729</FONT>    <a name="line.1729"></a>
<FONT color="green">1730</FONT>            /* Test for divide by zero */<a name="line.1730"></a>
<FONT color="green">1731</FONT>            if (divisor.mant[mant.length-1] == 0) {<a name="line.1731"></a>
<FONT color="green">1732</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_DIV_ZERO);<a name="line.1732"></a>
<FONT color="green">1733</FONT>                result = newInstance(getZero());<a name="line.1733"></a>
<FONT color="green">1734</FONT>                result.sign = (byte) (sign * divisor.sign);<a name="line.1734"></a>
<FONT color="green">1735</FONT>                result.nans = INFINITE;<a name="line.1735"></a>
<FONT color="green">1736</FONT>                result = dotrap(DfpField.FLAG_DIV_ZERO, DIVIDE_TRAP, divisor, result);<a name="line.1736"></a>
<FONT color="green">1737</FONT>                return result;<a name="line.1737"></a>
<FONT color="green">1738</FONT>            }<a name="line.1738"></a>
<FONT color="green">1739</FONT>    <a name="line.1739"></a>
<FONT color="green">1740</FONT>            dividend = new int[mant.length+1];  // one extra digit needed<a name="line.1740"></a>
<FONT color="green">1741</FONT>            quotient = new int[mant.length+2];  // two extra digits needed 1 for overflow, 1 for rounding<a name="line.1741"></a>
<FONT color="green">1742</FONT>            remainder = new int[mant.length+1]; // one extra digit needed<a name="line.1742"></a>
<FONT color="green">1743</FONT>    <a name="line.1743"></a>
<FONT color="green">1744</FONT>            /* Initialize our most significant digits to zero */<a name="line.1744"></a>
<FONT color="green">1745</FONT>    <a name="line.1745"></a>
<FONT color="green">1746</FONT>            dividend[mant.length] = 0;<a name="line.1746"></a>
<FONT color="green">1747</FONT>            quotient[mant.length] = 0;<a name="line.1747"></a>
<FONT color="green">1748</FONT>            quotient[mant.length+1] = 0;<a name="line.1748"></a>
<FONT color="green">1749</FONT>            remainder[mant.length] = 0;<a name="line.1749"></a>
<FONT color="green">1750</FONT>    <a name="line.1750"></a>
<FONT color="green">1751</FONT>            /* copy our mantissa into the dividend, initialize the<a name="line.1751"></a>
<FONT color="green">1752</FONT>           quotient while we are at it */<a name="line.1752"></a>
<FONT color="green">1753</FONT>    <a name="line.1753"></a>
<FONT color="green">1754</FONT>            for (int i = 0; i &lt; mant.length; i++) {<a name="line.1754"></a>
<FONT color="green">1755</FONT>                dividend[i] = mant[i];<a name="line.1755"></a>
<FONT color="green">1756</FONT>                quotient[i] = 0;<a name="line.1756"></a>
<FONT color="green">1757</FONT>                remainder[i] = 0;<a name="line.1757"></a>
<FONT color="green">1758</FONT>            }<a name="line.1758"></a>
<FONT color="green">1759</FONT>    <a name="line.1759"></a>
<FONT color="green">1760</FONT>            /* outer loop.  Once per quotient digit */<a name="line.1760"></a>
<FONT color="green">1761</FONT>            nsqd = 0;<a name="line.1761"></a>
<FONT color="green">1762</FONT>            for (qd = mant.length+1; qd &gt;= 0; qd--) {<a name="line.1762"></a>
<FONT color="green">1763</FONT>                /* Determine outer limits of our quotient digit */<a name="line.1763"></a>
<FONT color="green">1764</FONT>    <a name="line.1764"></a>
<FONT color="green">1765</FONT>                // r =  most sig 2 digits of dividend<a name="line.1765"></a>
<FONT color="green">1766</FONT>                final int divMsb = dividend[mant.length]*RADIX+dividend[mant.length-1];<a name="line.1766"></a>
<FONT color="green">1767</FONT>                int min = divMsb       / (divisor.mant[mant.length-1]+1);<a name="line.1767"></a>
<FONT color="green">1768</FONT>                int max = (divMsb + 1) / divisor.mant[mant.length-1];<a name="line.1768"></a>
<FONT color="green">1769</FONT>    <a name="line.1769"></a>
<FONT color="green">1770</FONT>                trialgood = false;<a name="line.1770"></a>
<FONT color="green">1771</FONT>                while (!trialgood) {<a name="line.1771"></a>
<FONT color="green">1772</FONT>                    // try the mean<a name="line.1772"></a>
<FONT color="green">1773</FONT>                    trial = (min+max)/2;<a name="line.1773"></a>
<FONT color="green">1774</FONT>    <a name="line.1774"></a>
<FONT color="green">1775</FONT>                    /* Multiply by divisor and store as remainder */<a name="line.1775"></a>
<FONT color="green">1776</FONT>                    int rh = 0;<a name="line.1776"></a>
<FONT color="green">1777</FONT>                    for (int i = 0; i &lt; mant.length + 1; i++) {<a name="line.1777"></a>
<FONT color="green">1778</FONT>                        int dm = (i&lt;mant.length)?divisor.mant[i]:0;<a name="line.1778"></a>
<FONT color="green">1779</FONT>                        final int r = (dm * trial) + rh;<a name="line.1779"></a>
<FONT color="green">1780</FONT>                        rh = r / RADIX;<a name="line.1780"></a>
<FONT color="green">1781</FONT>                        remainder[i] = r - rh * RADIX;<a name="line.1781"></a>
<FONT color="green">1782</FONT>                    }<a name="line.1782"></a>
<FONT color="green">1783</FONT>    <a name="line.1783"></a>
<FONT color="green">1784</FONT>                    /* subtract the remainder from the dividend */<a name="line.1784"></a>
<FONT color="green">1785</FONT>                    rh = 1;  // carry in to aid the subtraction<a name="line.1785"></a>
<FONT color="green">1786</FONT>                    for (int i = 0; i &lt; mant.length + 1; i++) {<a name="line.1786"></a>
<FONT color="green">1787</FONT>                        final int r = ((RADIX-1) - remainder[i]) + dividend[i] + rh;<a name="line.1787"></a>
<FONT color="green">1788</FONT>                        rh = r / RADIX;<a name="line.1788"></a>
<FONT color="green">1789</FONT>                        remainder[i] = r - rh * RADIX;<a name="line.1789"></a>
<FONT color="green">1790</FONT>                    }<a name="line.1790"></a>
<FONT color="green">1791</FONT>    <a name="line.1791"></a>
<FONT color="green">1792</FONT>                    /* Lets analyze what we have here */<a name="line.1792"></a>
<FONT color="green">1793</FONT>                    if (rh == 0) {<a name="line.1793"></a>
<FONT color="green">1794</FONT>                        // trial is too big -- negative remainder<a name="line.1794"></a>
<FONT color="green">1795</FONT>                        max = trial-1;<a name="line.1795"></a>
<FONT color="green">1796</FONT>                        continue;<a name="line.1796"></a>
<FONT color="green">1797</FONT>                    }<a name="line.1797"></a>
<FONT color="green">1798</FONT>    <a name="line.1798"></a>
<FONT color="green">1799</FONT>                    /* find out how far off the remainder is telling us we are */<a name="line.1799"></a>
<FONT color="green">1800</FONT>                    minadj = (remainder[mant.length] * RADIX)+remainder[mant.length-1];<a name="line.1800"></a>
<FONT color="green">1801</FONT>                    minadj = minadj / (divisor.mant[mant.length-1]+1);<a name="line.1801"></a>
<FONT color="green">1802</FONT>    <a name="line.1802"></a>
<FONT color="green">1803</FONT>                    if (minadj &gt;= 2) {<a name="line.1803"></a>
<FONT color="green">1804</FONT>                        min = trial+minadj;  // update the minimum<a name="line.1804"></a>
<FONT color="green">1805</FONT>                        continue;<a name="line.1805"></a>
<FONT color="green">1806</FONT>                    }<a name="line.1806"></a>
<FONT color="green">1807</FONT>    <a name="line.1807"></a>
<FONT color="green">1808</FONT>                    /* May have a good one here, check more thoroughly.  Basically<a name="line.1808"></a>
<FONT color="green">1809</FONT>               its a good one if it is less than the divisor */<a name="line.1809"></a>
<FONT color="green">1810</FONT>                    trialgood = false;  // assume false<a name="line.1810"></a>
<FONT color="green">1811</FONT>                    for (int i = mant.length - 1; i &gt;= 0; i--) {<a name="line.1811"></a>
<FONT color="green">1812</FONT>                        if (divisor.mant[i] &gt; remainder[i]) {<a name="line.1812"></a>
<FONT color="green">1813</FONT>                            trialgood = true;<a name="line.1813"></a>
<FONT color="green">1814</FONT>                        }<a name="line.1814"></a>
<FONT color="green">1815</FONT>                        if (divisor.mant[i] &lt; remainder[i]) {<a name="line.1815"></a>
<FONT color="green">1816</FONT>                            break;<a name="line.1816"></a>
<FONT color="green">1817</FONT>                        }<a name="line.1817"></a>
<FONT color="green">1818</FONT>                    }<a name="line.1818"></a>
<FONT color="green">1819</FONT>    <a name="line.1819"></a>
<FONT color="green">1820</FONT>                    if (remainder[mant.length] != 0) {<a name="line.1820"></a>
<FONT color="green">1821</FONT>                        trialgood = false;<a name="line.1821"></a>
<FONT color="green">1822</FONT>                    }<a name="line.1822"></a>
<FONT color="green">1823</FONT>    <a name="line.1823"></a>
<FONT color="green">1824</FONT>                    if (trialgood == false) {<a name="line.1824"></a>
<FONT color="green">1825</FONT>                        min = trial+1;<a name="line.1825"></a>
<FONT color="green">1826</FONT>                    }<a name="line.1826"></a>
<FONT color="green">1827</FONT>                }<a name="line.1827"></a>
<FONT color="green">1828</FONT>    <a name="line.1828"></a>
<FONT color="green">1829</FONT>                /* Great we have a digit! */<a name="line.1829"></a>
<FONT color="green">1830</FONT>                quotient[qd] = trial;<a name="line.1830"></a>
<FONT color="green">1831</FONT>                if (trial != 0 || nsqd != 0) {<a name="line.1831"></a>
<FONT color="green">1832</FONT>                    nsqd++;<a name="line.1832"></a>
<FONT color="green">1833</FONT>                }<a name="line.1833"></a>
<FONT color="green">1834</FONT>    <a name="line.1834"></a>
<FONT color="green">1835</FONT>                if (field.getRoundingMode() == DfpField.RoundingMode.ROUND_DOWN &amp;&amp; nsqd == mant.length) {<a name="line.1835"></a>
<FONT color="green">1836</FONT>                    // We have enough for this mode<a name="line.1836"></a>
<FONT color="green">1837</FONT>                    break;<a name="line.1837"></a>
<FONT color="green">1838</FONT>                }<a name="line.1838"></a>
<FONT color="green">1839</FONT>    <a name="line.1839"></a>
<FONT color="green">1840</FONT>                if (nsqd &gt; mant.length) {<a name="line.1840"></a>
<FONT color="green">1841</FONT>                    // We have enough digits<a name="line.1841"></a>
<FONT color="green">1842</FONT>                    break;<a name="line.1842"></a>
<FONT color="green">1843</FONT>                }<a name="line.1843"></a>
<FONT color="green">1844</FONT>    <a name="line.1844"></a>
<FONT color="green">1845</FONT>                /* move the remainder into the dividend while left shifting */<a name="line.1845"></a>
<FONT color="green">1846</FONT>                dividend[0] = 0;<a name="line.1846"></a>
<FONT color="green">1847</FONT>                for (int i = 0; i &lt; mant.length; i++) {<a name="line.1847"></a>
<FONT color="green">1848</FONT>                    dividend[i + 1] = remainder[i];<a name="line.1848"></a>
<FONT color="green">1849</FONT>                }<a name="line.1849"></a>
<FONT color="green">1850</FONT>            }<a name="line.1850"></a>
<FONT color="green">1851</FONT>    <a name="line.1851"></a>
<FONT color="green">1852</FONT>            /* Find the most sig digit */<a name="line.1852"></a>
<FONT color="green">1853</FONT>            md = mant.length;  // default<a name="line.1853"></a>
<FONT color="green">1854</FONT>            for (int i = mant.length + 1; i &gt;= 0; i--) {<a name="line.1854"></a>
<FONT color="green">1855</FONT>                if (quotient[i] != 0) {<a name="line.1855"></a>
<FONT color="green">1856</FONT>                    md = i;<a name="line.1856"></a>
<FONT color="green">1857</FONT>                    break;<a name="line.1857"></a>
<FONT color="green">1858</FONT>                }<a name="line.1858"></a>
<FONT color="green">1859</FONT>            }<a name="line.1859"></a>
<FONT color="green">1860</FONT>    <a name="line.1860"></a>
<FONT color="green">1861</FONT>            /* Copy the digits into the result */<a name="line.1861"></a>
<FONT color="green">1862</FONT>            for (int i=0; i&lt;mant.length; i++) {<a name="line.1862"></a>
<FONT color="green">1863</FONT>                result.mant[mant.length-i-1] = quotient[md-i];<a name="line.1863"></a>
<FONT color="green">1864</FONT>            }<a name="line.1864"></a>
<FONT color="green">1865</FONT>    <a name="line.1865"></a>
<FONT color="green">1866</FONT>            /* Fixup the exponent. */<a name="line.1866"></a>
<FONT color="green">1867</FONT>            result.exp = exp - divisor.exp + md - mant.length;<a name="line.1867"></a>
<FONT color="green">1868</FONT>            result.sign = (byte) ((sign == divisor.sign) ? 1 : -1);<a name="line.1868"></a>
<FONT color="green">1869</FONT>    <a name="line.1869"></a>
<FONT color="green">1870</FONT>            if (result.mant[mant.length-1] == 0) { // if result is zero, set exp to zero<a name="line.1870"></a>
<FONT color="green">1871</FONT>                result.exp = 0;<a name="line.1871"></a>
<FONT color="green">1872</FONT>            }<a name="line.1872"></a>
<FONT color="green">1873</FONT>    <a name="line.1873"></a>
<FONT color="green">1874</FONT>            if (md &gt; (mant.length-1)) {<a name="line.1874"></a>
<FONT color="green">1875</FONT>                excp = result.round(quotient[md-mant.length]);<a name="line.1875"></a>
<FONT color="green">1876</FONT>            } else {<a name="line.1876"></a>
<FONT color="green">1877</FONT>                excp = result.round(0);<a name="line.1877"></a>
<FONT color="green">1878</FONT>            }<a name="line.1878"></a>
<FONT color="green">1879</FONT>    <a name="line.1879"></a>
<FONT color="green">1880</FONT>            if (excp != 0) {<a name="line.1880"></a>
<FONT color="green">1881</FONT>                result = dotrap(excp, DIVIDE_TRAP, divisor, result);<a name="line.1881"></a>
<FONT color="green">1882</FONT>            }<a name="line.1882"></a>
<FONT color="green">1883</FONT>    <a name="line.1883"></a>
<FONT color="green">1884</FONT>            return result;<a name="line.1884"></a>
<FONT color="green">1885</FONT>        }<a name="line.1885"></a>
<FONT color="green">1886</FONT>    <a name="line.1886"></a>
<FONT color="green">1887</FONT>        /** Divide by a single digit less than radix.<a name="line.1887"></a>
<FONT color="green">1888</FONT>         *  Special case, so there are speed advantages. 0 &amp;lt;= divisor &amp;lt; radix<a name="line.1888"></a>
<FONT color="green">1889</FONT>         * @param divisor divisor<a name="line.1889"></a>
<FONT color="green">1890</FONT>         * @return quotient of this by divisor<a name="line.1890"></a>
<FONT color="green">1891</FONT>         */<a name="line.1891"></a>
<FONT color="green">1892</FONT>        public Dfp divide(int divisor) {<a name="line.1892"></a>
<FONT color="green">1893</FONT>    <a name="line.1893"></a>
<FONT color="green">1894</FONT>            // Handle special cases<a name="line.1894"></a>
<FONT color="green">1895</FONT>            if (nans != FINITE) {<a name="line.1895"></a>
<FONT color="green">1896</FONT>                if (isNaN()) {<a name="line.1896"></a>
<FONT color="green">1897</FONT>                    return this;<a name="line.1897"></a>
<FONT color="green">1898</FONT>                }<a name="line.1898"></a>
<FONT color="green">1899</FONT>    <a name="line.1899"></a>
<FONT color="green">1900</FONT>                if (nans == INFINITE) {<a name="line.1900"></a>
<FONT color="green">1901</FONT>                    return newInstance(this);<a name="line.1901"></a>
<FONT color="green">1902</FONT>                }<a name="line.1902"></a>
<FONT color="green">1903</FONT>            }<a name="line.1903"></a>
<FONT color="green">1904</FONT>    <a name="line.1904"></a>
<FONT color="green">1905</FONT>            // Test for divide by zero<a name="line.1905"></a>
<FONT color="green">1906</FONT>            if (divisor == 0) {<a name="line.1906"></a>
<FONT color="green">1907</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_DIV_ZERO);<a name="line.1907"></a>
<FONT color="green">1908</FONT>                Dfp result = newInstance(getZero());<a name="line.1908"></a>
<FONT color="green">1909</FONT>                result.sign = sign;<a name="line.1909"></a>
<FONT color="green">1910</FONT>                result.nans = INFINITE;<a name="line.1910"></a>
<FONT color="green">1911</FONT>                result = dotrap(DfpField.FLAG_DIV_ZERO, DIVIDE_TRAP, getZero(), result);<a name="line.1911"></a>
<FONT color="green">1912</FONT>                return result;<a name="line.1912"></a>
<FONT color="green">1913</FONT>            }<a name="line.1913"></a>
<FONT color="green">1914</FONT>    <a name="line.1914"></a>
<FONT color="green">1915</FONT>            // range check divisor<a name="line.1915"></a>
<FONT color="green">1916</FONT>            if (divisor &lt; 0 || divisor &gt;= RADIX) {<a name="line.1916"></a>
<FONT color="green">1917</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INVALID);<a name="line.1917"></a>
<FONT color="green">1918</FONT>                Dfp result = newInstance(getZero());<a name="line.1918"></a>
<FONT color="green">1919</FONT>                result.nans = QNAN;<a name="line.1919"></a>
<FONT color="green">1920</FONT>                result = dotrap(DfpField.FLAG_INVALID, DIVIDE_TRAP, result, result);<a name="line.1920"></a>
<FONT color="green">1921</FONT>                return result;<a name="line.1921"></a>
<FONT color="green">1922</FONT>            }<a name="line.1922"></a>
<FONT color="green">1923</FONT>    <a name="line.1923"></a>
<FONT color="green">1924</FONT>            Dfp result = newInstance(this);<a name="line.1924"></a>
<FONT color="green">1925</FONT>    <a name="line.1925"></a>
<FONT color="green">1926</FONT>            int rl = 0;<a name="line.1926"></a>
<FONT color="green">1927</FONT>            for (int i = mant.length-1; i &gt;= 0; i--) {<a name="line.1927"></a>
<FONT color="green">1928</FONT>                final int r = rl*RADIX + result.mant[i];<a name="line.1928"></a>
<FONT color="green">1929</FONT>                final int rh = r / divisor;<a name="line.1929"></a>
<FONT color="green">1930</FONT>                rl = r - rh * divisor;<a name="line.1930"></a>
<FONT color="green">1931</FONT>                result.mant[i] = rh;<a name="line.1931"></a>
<FONT color="green">1932</FONT>            }<a name="line.1932"></a>
<FONT color="green">1933</FONT>    <a name="line.1933"></a>
<FONT color="green">1934</FONT>            if (result.mant[mant.length-1] == 0) {<a name="line.1934"></a>
<FONT color="green">1935</FONT>                // normalize<a name="line.1935"></a>
<FONT color="green">1936</FONT>                result.shiftLeft();<a name="line.1936"></a>
<FONT color="green">1937</FONT>                final int r = rl * RADIX;        // compute the next digit and put it in<a name="line.1937"></a>
<FONT color="green">1938</FONT>                final int rh = r / divisor;<a name="line.1938"></a>
<FONT color="green">1939</FONT>                rl = r - rh * divisor;<a name="line.1939"></a>
<FONT color="green">1940</FONT>                result.mant[0] = rh;<a name="line.1940"></a>
<FONT color="green">1941</FONT>            }<a name="line.1941"></a>
<FONT color="green">1942</FONT>    <a name="line.1942"></a>
<FONT color="green">1943</FONT>            final int excp = result.round(rl * RADIX / divisor);  // do the rounding<a name="line.1943"></a>
<FONT color="green">1944</FONT>            if (excp != 0) {<a name="line.1944"></a>
<FONT color="green">1945</FONT>                result = dotrap(excp, DIVIDE_TRAP, result, result);<a name="line.1945"></a>
<FONT color="green">1946</FONT>            }<a name="line.1946"></a>
<FONT color="green">1947</FONT>    <a name="line.1947"></a>
<FONT color="green">1948</FONT>            return result;<a name="line.1948"></a>
<FONT color="green">1949</FONT>    <a name="line.1949"></a>
<FONT color="green">1950</FONT>        }<a name="line.1950"></a>
<FONT color="green">1951</FONT>    <a name="line.1951"></a>
<FONT color="green">1952</FONT>        /** {@inheritDoc} */<a name="line.1952"></a>
<FONT color="green">1953</FONT>        public Dfp reciprocal() {<a name="line.1953"></a>
<FONT color="green">1954</FONT>            return field.getOne().divide(this);<a name="line.1954"></a>
<FONT color="green">1955</FONT>        }<a name="line.1955"></a>
<FONT color="green">1956</FONT>    <a name="line.1956"></a>
<FONT color="green">1957</FONT>        /** Compute the square root.<a name="line.1957"></a>
<FONT color="green">1958</FONT>         * @return square root of the instance<a name="line.1958"></a>
<FONT color="green">1959</FONT>         */<a name="line.1959"></a>
<FONT color="green">1960</FONT>        public Dfp sqrt() {<a name="line.1960"></a>
<FONT color="green">1961</FONT>    <a name="line.1961"></a>
<FONT color="green">1962</FONT>            // check for unusual cases<a name="line.1962"></a>
<FONT color="green">1963</FONT>            if (nans == FINITE &amp;&amp; mant[mant.length-1] == 0) {<a name="line.1963"></a>
<FONT color="green">1964</FONT>                // if zero<a name="line.1964"></a>
<FONT color="green">1965</FONT>                return newInstance(this);<a name="line.1965"></a>
<FONT color="green">1966</FONT>            }<a name="line.1966"></a>
<FONT color="green">1967</FONT>    <a name="line.1967"></a>
<FONT color="green">1968</FONT>            if (nans != FINITE) {<a name="line.1968"></a>
<FONT color="green">1969</FONT>                if (nans == INFINITE &amp;&amp; sign == 1) {<a name="line.1969"></a>
<FONT color="green">1970</FONT>                    // if positive infinity<a name="line.1970"></a>
<FONT color="green">1971</FONT>                    return newInstance(this);<a name="line.1971"></a>
<FONT color="green">1972</FONT>                }<a name="line.1972"></a>
<FONT color="green">1973</FONT>    <a name="line.1973"></a>
<FONT color="green">1974</FONT>                if (nans == QNAN) {<a name="line.1974"></a>
<FONT color="green">1975</FONT>                    return newInstance(this);<a name="line.1975"></a>
<FONT color="green">1976</FONT>                }<a name="line.1976"></a>
<FONT color="green">1977</FONT>    <a name="line.1977"></a>
<FONT color="green">1978</FONT>                if (nans == SNAN) {<a name="line.1978"></a>
<FONT color="green">1979</FONT>                    Dfp result;<a name="line.1979"></a>
<FONT color="green">1980</FONT>    <a name="line.1980"></a>
<FONT color="green">1981</FONT>                    field.setIEEEFlagsBits(DfpField.FLAG_INVALID);<a name="line.1981"></a>
<FONT color="green">1982</FONT>                    result = newInstance(this);<a name="line.1982"></a>
<FONT color="green">1983</FONT>                    result = dotrap(DfpField.FLAG_INVALID, SQRT_TRAP, null, result);<a name="line.1983"></a>
<FONT color="green">1984</FONT>                    return result;<a name="line.1984"></a>
<FONT color="green">1985</FONT>                }<a name="line.1985"></a>
<FONT color="green">1986</FONT>            }<a name="line.1986"></a>
<FONT color="green">1987</FONT>    <a name="line.1987"></a>
<FONT color="green">1988</FONT>            if (sign == -1) {<a name="line.1988"></a>
<FONT color="green">1989</FONT>                // if negative<a name="line.1989"></a>
<FONT color="green">1990</FONT>                Dfp result;<a name="line.1990"></a>
<FONT color="green">1991</FONT>    <a name="line.1991"></a>
<FONT color="green">1992</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INVALID);<a name="line.1992"></a>
<FONT color="green">1993</FONT>                result = newInstance(this);<a name="line.1993"></a>
<FONT color="green">1994</FONT>                result.nans = QNAN;<a name="line.1994"></a>
<FONT color="green">1995</FONT>                result = dotrap(DfpField.FLAG_INVALID, SQRT_TRAP, null, result);<a name="line.1995"></a>
<FONT color="green">1996</FONT>                return result;<a name="line.1996"></a>
<FONT color="green">1997</FONT>            }<a name="line.1997"></a>
<FONT color="green">1998</FONT>    <a name="line.1998"></a>
<FONT color="green">1999</FONT>            Dfp x = newInstance(this);<a name="line.1999"></a>
<FONT color="green">2000</FONT>    <a name="line.2000"></a>
<FONT color="green">2001</FONT>            /* Lets make a reasonable guess as to the size of the square root */<a name="line.2001"></a>
<FONT color="green">2002</FONT>            if (x.exp &lt; -1 || x.exp &gt; 1) {<a name="line.2002"></a>
<FONT color="green">2003</FONT>                x.exp = this.exp / 2;<a name="line.2003"></a>
<FONT color="green">2004</FONT>            }<a name="line.2004"></a>
<FONT color="green">2005</FONT>    <a name="line.2005"></a>
<FONT color="green">2006</FONT>            /* Coarsely estimate the mantissa */<a name="line.2006"></a>
<FONT color="green">2007</FONT>            switch (x.mant[mant.length-1] / 2000) {<a name="line.2007"></a>
<FONT color="green">2008</FONT>                case 0:<a name="line.2008"></a>
<FONT color="green">2009</FONT>                    x.mant[mant.length-1] = x.mant[mant.length-1]/2+1;<a name="line.2009"></a>
<FONT color="green">2010</FONT>                    break;<a name="line.2010"></a>
<FONT color="green">2011</FONT>                case 2:<a name="line.2011"></a>
<FONT color="green">2012</FONT>                    x.mant[mant.length-1] = 1500;<a name="line.2012"></a>
<FONT color="green">2013</FONT>                    break;<a name="line.2013"></a>
<FONT color="green">2014</FONT>                case 3:<a name="line.2014"></a>
<FONT color="green">2015</FONT>                    x.mant[mant.length-1] = 2200;<a name="line.2015"></a>
<FONT color="green">2016</FONT>                    break;<a name="line.2016"></a>
<FONT color="green">2017</FONT>                default:<a name="line.2017"></a>
<FONT color="green">2018</FONT>                    x.mant[mant.length-1] = 3000;<a name="line.2018"></a>
<FONT color="green">2019</FONT>            }<a name="line.2019"></a>
<FONT color="green">2020</FONT>    <a name="line.2020"></a>
<FONT color="green">2021</FONT>            Dfp dx = newInstance(x);<a name="line.2021"></a>
<FONT color="green">2022</FONT>    <a name="line.2022"></a>
<FONT color="green">2023</FONT>            /* Now that we have the first pass estimate, compute the rest<a name="line.2023"></a>
<FONT color="green">2024</FONT>           by the formula dx = (y - x*x) / (2x); */<a name="line.2024"></a>
<FONT color="green">2025</FONT>    <a name="line.2025"></a>
<FONT color="green">2026</FONT>            Dfp px  = getZero();<a name="line.2026"></a>
<FONT color="green">2027</FONT>            Dfp ppx = getZero();<a name="line.2027"></a>
<FONT color="green">2028</FONT>            while (x.unequal(px)) {<a name="line.2028"></a>
<FONT color="green">2029</FONT>                dx = newInstance(x);<a name="line.2029"></a>
<FONT color="green">2030</FONT>                dx.sign = -1;<a name="line.2030"></a>
<FONT color="green">2031</FONT>                dx = dx.add(this.divide(x));<a name="line.2031"></a>
<FONT color="green">2032</FONT>                dx = dx.divide(2);<a name="line.2032"></a>
<FONT color="green">2033</FONT>                ppx = px;<a name="line.2033"></a>
<FONT color="green">2034</FONT>                px = x;<a name="line.2034"></a>
<FONT color="green">2035</FONT>                x = x.add(dx);<a name="line.2035"></a>
<FONT color="green">2036</FONT>    <a name="line.2036"></a>
<FONT color="green">2037</FONT>                if (x.equals(ppx)) {<a name="line.2037"></a>
<FONT color="green">2038</FONT>                    // alternating between two values<a name="line.2038"></a>
<FONT color="green">2039</FONT>                    break;<a name="line.2039"></a>
<FONT color="green">2040</FONT>                }<a name="line.2040"></a>
<FONT color="green">2041</FONT>    <a name="line.2041"></a>
<FONT color="green">2042</FONT>                // if dx is zero, break.  Note testing the most sig digit<a name="line.2042"></a>
<FONT color="green">2043</FONT>                // is a sufficient test since dx is normalized<a name="line.2043"></a>
<FONT color="green">2044</FONT>                if (dx.mant[mant.length-1] == 0) {<a name="line.2044"></a>
<FONT color="green">2045</FONT>                    break;<a name="line.2045"></a>
<FONT color="green">2046</FONT>                }<a name="line.2046"></a>
<FONT color="green">2047</FONT>            }<a name="line.2047"></a>
<FONT color="green">2048</FONT>    <a name="line.2048"></a>
<FONT color="green">2049</FONT>            return x;<a name="line.2049"></a>
<FONT color="green">2050</FONT>    <a name="line.2050"></a>
<FONT color="green">2051</FONT>        }<a name="line.2051"></a>
<FONT color="green">2052</FONT>    <a name="line.2052"></a>
<FONT color="green">2053</FONT>        /** Get a string representation of the instance.<a name="line.2053"></a>
<FONT color="green">2054</FONT>         * @return string representation of the instance<a name="line.2054"></a>
<FONT color="green">2055</FONT>         */<a name="line.2055"></a>
<FONT color="green">2056</FONT>        @Override<a name="line.2056"></a>
<FONT color="green">2057</FONT>        public String toString() {<a name="line.2057"></a>
<FONT color="green">2058</FONT>            if (nans != FINITE) {<a name="line.2058"></a>
<FONT color="green">2059</FONT>                // if non-finite exceptional cases<a name="line.2059"></a>
<FONT color="green">2060</FONT>                if (nans == INFINITE) {<a name="line.2060"></a>
<FONT color="green">2061</FONT>                    return (sign &lt; 0) ? NEG_INFINITY_STRING : POS_INFINITY_STRING;<a name="line.2061"></a>
<FONT color="green">2062</FONT>                } else {<a name="line.2062"></a>
<FONT color="green">2063</FONT>                    return NAN_STRING;<a name="line.2063"></a>
<FONT color="green">2064</FONT>                }<a name="line.2064"></a>
<FONT color="green">2065</FONT>            }<a name="line.2065"></a>
<FONT color="green">2066</FONT>    <a name="line.2066"></a>
<FONT color="green">2067</FONT>            if (exp &gt; mant.length || exp &lt; -1) {<a name="line.2067"></a>
<FONT color="green">2068</FONT>                return dfp2sci();<a name="line.2068"></a>
<FONT color="green">2069</FONT>            }<a name="line.2069"></a>
<FONT color="green">2070</FONT>    <a name="line.2070"></a>
<FONT color="green">2071</FONT>            return dfp2string();<a name="line.2071"></a>
<FONT color="green">2072</FONT>    <a name="line.2072"></a>
<FONT color="green">2073</FONT>        }<a name="line.2073"></a>
<FONT color="green">2074</FONT>    <a name="line.2074"></a>
<FONT color="green">2075</FONT>        /** Convert an instance to a string using scientific notation.<a name="line.2075"></a>
<FONT color="green">2076</FONT>         * @return string representation of the instance in scientific notation<a name="line.2076"></a>
<FONT color="green">2077</FONT>         */<a name="line.2077"></a>
<FONT color="green">2078</FONT>        protected String dfp2sci() {<a name="line.2078"></a>
<FONT color="green">2079</FONT>            char rawdigits[]    = new char[mant.length * 4];<a name="line.2079"></a>
<FONT color="green">2080</FONT>            char outputbuffer[] = new char[mant.length * 4 + 20];<a name="line.2080"></a>
<FONT color="green">2081</FONT>            int p;<a name="line.2081"></a>
<FONT color="green">2082</FONT>            int q;<a name="line.2082"></a>
<FONT color="green">2083</FONT>            int e;<a name="line.2083"></a>
<FONT color="green">2084</FONT>            int ae;<a name="line.2084"></a>
<FONT color="green">2085</FONT>            int shf;<a name="line.2085"></a>
<FONT color="green">2086</FONT>    <a name="line.2086"></a>
<FONT color="green">2087</FONT>            // Get all the digits<a name="line.2087"></a>
<FONT color="green">2088</FONT>            p = 0;<a name="line.2088"></a>
<FONT color="green">2089</FONT>            for (int i = mant.length - 1; i &gt;= 0; i--) {<a name="line.2089"></a>
<FONT color="green">2090</FONT>                rawdigits[p++] = (char) ((mant[i] / 1000) + '0');<a name="line.2090"></a>
<FONT color="green">2091</FONT>                rawdigits[p++] = (char) (((mant[i] / 100) %10) + '0');<a name="line.2091"></a>
<FONT color="green">2092</FONT>                rawdigits[p++] = (char) (((mant[i] / 10) % 10) + '0');<a name="line.2092"></a>
<FONT color="green">2093</FONT>                rawdigits[p++] = (char) (((mant[i]) % 10) + '0');<a name="line.2093"></a>
<FONT color="green">2094</FONT>            }<a name="line.2094"></a>
<FONT color="green">2095</FONT>    <a name="line.2095"></a>
<FONT color="green">2096</FONT>            // Find the first non-zero one<a name="line.2096"></a>
<FONT color="green">2097</FONT>            for (p = 0; p &lt; rawdigits.length; p++) {<a name="line.2097"></a>
<FONT color="green">2098</FONT>                if (rawdigits[p] != '0') {<a name="line.2098"></a>
<FONT color="green">2099</FONT>                    break;<a name="line.2099"></a>
<FONT color="green">2100</FONT>                }<a name="line.2100"></a>
<FONT color="green">2101</FONT>            }<a name="line.2101"></a>
<FONT color="green">2102</FONT>            shf = p;<a name="line.2102"></a>
<FONT color="green">2103</FONT>    <a name="line.2103"></a>
<FONT color="green">2104</FONT>            // Now do the conversion<a name="line.2104"></a>
<FONT color="green">2105</FONT>            q = 0;<a name="line.2105"></a>
<FONT color="green">2106</FONT>            if (sign == -1) {<a name="line.2106"></a>
<FONT color="green">2107</FONT>                outputbuffer[q++] = '-';<a name="line.2107"></a>
<FONT color="green">2108</FONT>            }<a name="line.2108"></a>
<FONT color="green">2109</FONT>    <a name="line.2109"></a>
<FONT color="green">2110</FONT>            if (p != rawdigits.length) {<a name="line.2110"></a>
<FONT color="green">2111</FONT>                // there are non zero digits...<a name="line.2111"></a>
<FONT color="green">2112</FONT>                outputbuffer[q++] = rawdigits[p++];<a name="line.2112"></a>
<FONT color="green">2113</FONT>                outputbuffer[q++] = '.';<a name="line.2113"></a>
<FONT color="green">2114</FONT>    <a name="line.2114"></a>
<FONT color="green">2115</FONT>                while (p&lt;rawdigits.length) {<a name="line.2115"></a>
<FONT color="green">2116</FONT>                    outputbuffer[q++] = rawdigits[p++];<a name="line.2116"></a>
<FONT color="green">2117</FONT>                }<a name="line.2117"></a>
<FONT color="green">2118</FONT>            } else {<a name="line.2118"></a>
<FONT color="green">2119</FONT>                outputbuffer[q++] = '0';<a name="line.2119"></a>
<FONT color="green">2120</FONT>                outputbuffer[q++] = '.';<a name="line.2120"></a>
<FONT color="green">2121</FONT>                outputbuffer[q++] = '0';<a name="line.2121"></a>
<FONT color="green">2122</FONT>                outputbuffer[q++] = 'e';<a name="line.2122"></a>
<FONT color="green">2123</FONT>                outputbuffer[q++] = '0';<a name="line.2123"></a>
<FONT color="green">2124</FONT>                return new String(outputbuffer, 0, 5);<a name="line.2124"></a>
<FONT color="green">2125</FONT>            }<a name="line.2125"></a>
<FONT color="green">2126</FONT>    <a name="line.2126"></a>
<FONT color="green">2127</FONT>            outputbuffer[q++] = 'e';<a name="line.2127"></a>
<FONT color="green">2128</FONT>    <a name="line.2128"></a>
<FONT color="green">2129</FONT>            // Find the msd of the exponent<a name="line.2129"></a>
<FONT color="green">2130</FONT>    <a name="line.2130"></a>
<FONT color="green">2131</FONT>            e = exp * 4 - shf - 1;<a name="line.2131"></a>
<FONT color="green">2132</FONT>            ae = e;<a name="line.2132"></a>
<FONT color="green">2133</FONT>            if (e &lt; 0) {<a name="line.2133"></a>
<FONT color="green">2134</FONT>                ae = -e;<a name="line.2134"></a>
<FONT color="green">2135</FONT>            }<a name="line.2135"></a>
<FONT color="green">2136</FONT>    <a name="line.2136"></a>
<FONT color="green">2137</FONT>            // Find the largest p such that p &lt; e<a name="line.2137"></a>
<FONT color="green">2138</FONT>            for (p = 1000000000; p &gt; ae; p /= 10) {<a name="line.2138"></a>
<FONT color="green">2139</FONT>                // nothing to do<a name="line.2139"></a>
<FONT color="green">2140</FONT>            }<a name="line.2140"></a>
<FONT color="green">2141</FONT>    <a name="line.2141"></a>
<FONT color="green">2142</FONT>            if (e &lt; 0) {<a name="line.2142"></a>
<FONT color="green">2143</FONT>                outputbuffer[q++] = '-';<a name="line.2143"></a>
<FONT color="green">2144</FONT>            }<a name="line.2144"></a>
<FONT color="green">2145</FONT>    <a name="line.2145"></a>
<FONT color="green">2146</FONT>            while (p &gt; 0) {<a name="line.2146"></a>
<FONT color="green">2147</FONT>                outputbuffer[q++] = (char)(ae / p + '0');<a name="line.2147"></a>
<FONT color="green">2148</FONT>                ae = ae % p;<a name="line.2148"></a>
<FONT color="green">2149</FONT>                p = p / 10;<a name="line.2149"></a>
<FONT color="green">2150</FONT>            }<a name="line.2150"></a>
<FONT color="green">2151</FONT>    <a name="line.2151"></a>
<FONT color="green">2152</FONT>            return new String(outputbuffer, 0, q);<a name="line.2152"></a>
<FONT color="green">2153</FONT>    <a name="line.2153"></a>
<FONT color="green">2154</FONT>        }<a name="line.2154"></a>
<FONT color="green">2155</FONT>    <a name="line.2155"></a>
<FONT color="green">2156</FONT>        /** Convert an instance to a string using normal notation.<a name="line.2156"></a>
<FONT color="green">2157</FONT>         * @return string representation of the instance in normal notation<a name="line.2157"></a>
<FONT color="green">2158</FONT>         */<a name="line.2158"></a>
<FONT color="green">2159</FONT>        protected String dfp2string() {<a name="line.2159"></a>
<FONT color="green">2160</FONT>            char buffer[] = new char[mant.length*4 + 20];<a name="line.2160"></a>
<FONT color="green">2161</FONT>            int p = 1;<a name="line.2161"></a>
<FONT color="green">2162</FONT>            int q;<a name="line.2162"></a>
<FONT color="green">2163</FONT>            int e = exp;<a name="line.2163"></a>
<FONT color="green">2164</FONT>            boolean pointInserted = false;<a name="line.2164"></a>
<FONT color="green">2165</FONT>    <a name="line.2165"></a>
<FONT color="green">2166</FONT>            buffer[0] = ' ';<a name="line.2166"></a>
<FONT color="green">2167</FONT>    <a name="line.2167"></a>
<FONT color="green">2168</FONT>            if (e &lt;= 0) {<a name="line.2168"></a>
<FONT color="green">2169</FONT>                buffer[p++] = '0';<a name="line.2169"></a>
<FONT color="green">2170</FONT>                buffer[p++] = '.';<a name="line.2170"></a>
<FONT color="green">2171</FONT>                pointInserted = true;<a name="line.2171"></a>
<FONT color="green">2172</FONT>            }<a name="line.2172"></a>
<FONT color="green">2173</FONT>    <a name="line.2173"></a>
<FONT color="green">2174</FONT>            while (e &lt; 0) {<a name="line.2174"></a>
<FONT color="green">2175</FONT>                buffer[p++] = '0';<a name="line.2175"></a>
<FONT color="green">2176</FONT>                buffer[p++] = '0';<a name="line.2176"></a>
<FONT color="green">2177</FONT>                buffer[p++] = '0';<a name="line.2177"></a>
<FONT color="green">2178</FONT>                buffer[p++] = '0';<a name="line.2178"></a>
<FONT color="green">2179</FONT>                e++;<a name="line.2179"></a>
<FONT color="green">2180</FONT>            }<a name="line.2180"></a>
<FONT color="green">2181</FONT>    <a name="line.2181"></a>
<FONT color="green">2182</FONT>            for (int i = mant.length - 1; i &gt;= 0; i--) {<a name="line.2182"></a>
<FONT color="green">2183</FONT>                buffer[p++] = (char) ((mant[i] / 1000) + '0');<a name="line.2183"></a>
<FONT color="green">2184</FONT>                buffer[p++] = (char) (((mant[i] / 100) % 10) + '0');<a name="line.2184"></a>
<FONT color="green">2185</FONT>                buffer[p++] = (char) (((mant[i] / 10) % 10) + '0');<a name="line.2185"></a>
<FONT color="green">2186</FONT>                buffer[p++] = (char) (((mant[i]) % 10) + '0');<a name="line.2186"></a>
<FONT color="green">2187</FONT>                if (--e == 0) {<a name="line.2187"></a>
<FONT color="green">2188</FONT>                    buffer[p++] = '.';<a name="line.2188"></a>
<FONT color="green">2189</FONT>                    pointInserted = true;<a name="line.2189"></a>
<FONT color="green">2190</FONT>                }<a name="line.2190"></a>
<FONT color="green">2191</FONT>            }<a name="line.2191"></a>
<FONT color="green">2192</FONT>    <a name="line.2192"></a>
<FONT color="green">2193</FONT>            while (e &gt; 0) {<a name="line.2193"></a>
<FONT color="green">2194</FONT>                buffer[p++] = '0';<a name="line.2194"></a>
<FONT color="green">2195</FONT>                buffer[p++] = '0';<a name="line.2195"></a>
<FONT color="green">2196</FONT>                buffer[p++] = '0';<a name="line.2196"></a>
<FONT color="green">2197</FONT>                buffer[p++] = '0';<a name="line.2197"></a>
<FONT color="green">2198</FONT>                e--;<a name="line.2198"></a>
<FONT color="green">2199</FONT>            }<a name="line.2199"></a>
<FONT color="green">2200</FONT>    <a name="line.2200"></a>
<FONT color="green">2201</FONT>            if (!pointInserted) {<a name="line.2201"></a>
<FONT color="green">2202</FONT>                // Ensure we have a radix point!<a name="line.2202"></a>
<FONT color="green">2203</FONT>                buffer[p++] = '.';<a name="line.2203"></a>
<FONT color="green">2204</FONT>            }<a name="line.2204"></a>
<FONT color="green">2205</FONT>    <a name="line.2205"></a>
<FONT color="green">2206</FONT>            // Suppress leading zeros<a name="line.2206"></a>
<FONT color="green">2207</FONT>            q = 1;<a name="line.2207"></a>
<FONT color="green">2208</FONT>            while (buffer[q] == '0') {<a name="line.2208"></a>
<FONT color="green">2209</FONT>                q++;<a name="line.2209"></a>
<FONT color="green">2210</FONT>            }<a name="line.2210"></a>
<FONT color="green">2211</FONT>            if (buffer[q] == '.') {<a name="line.2211"></a>
<FONT color="green">2212</FONT>                q--;<a name="line.2212"></a>
<FONT color="green">2213</FONT>            }<a name="line.2213"></a>
<FONT color="green">2214</FONT>    <a name="line.2214"></a>
<FONT color="green">2215</FONT>            // Suppress trailing zeros<a name="line.2215"></a>
<FONT color="green">2216</FONT>            while (buffer[p-1] == '0') {<a name="line.2216"></a>
<FONT color="green">2217</FONT>                p--;<a name="line.2217"></a>
<FONT color="green">2218</FONT>            }<a name="line.2218"></a>
<FONT color="green">2219</FONT>    <a name="line.2219"></a>
<FONT color="green">2220</FONT>            // Insert sign<a name="line.2220"></a>
<FONT color="green">2221</FONT>            if (sign &lt; 0) {<a name="line.2221"></a>
<FONT color="green">2222</FONT>                buffer[--q] = '-';<a name="line.2222"></a>
<FONT color="green">2223</FONT>            }<a name="line.2223"></a>
<FONT color="green">2224</FONT>    <a name="line.2224"></a>
<FONT color="green">2225</FONT>            return new String(buffer, q, p - q);<a name="line.2225"></a>
<FONT color="green">2226</FONT>    <a name="line.2226"></a>
<FONT color="green">2227</FONT>        }<a name="line.2227"></a>
<FONT color="green">2228</FONT>    <a name="line.2228"></a>
<FONT color="green">2229</FONT>        /** Raises a trap.  This does not set the corresponding flag however.<a name="line.2229"></a>
<FONT color="green">2230</FONT>         *  @param type the trap type<a name="line.2230"></a>
<FONT color="green">2231</FONT>         *  @param what - name of routine trap occurred in<a name="line.2231"></a>
<FONT color="green">2232</FONT>         *  @param oper - input operator to function<a name="line.2232"></a>
<FONT color="green">2233</FONT>         *  @param result - the result computed prior to the trap<a name="line.2233"></a>
<FONT color="green">2234</FONT>         *  @return The suggested return value from the trap handler<a name="line.2234"></a>
<FONT color="green">2235</FONT>         */<a name="line.2235"></a>
<FONT color="green">2236</FONT>        public Dfp dotrap(int type, String what, Dfp oper, Dfp result) {<a name="line.2236"></a>
<FONT color="green">2237</FONT>            Dfp def = result;<a name="line.2237"></a>
<FONT color="green">2238</FONT>    <a name="line.2238"></a>
<FONT color="green">2239</FONT>            switch (type) {<a name="line.2239"></a>
<FONT color="green">2240</FONT>                case DfpField.FLAG_INVALID:<a name="line.2240"></a>
<FONT color="green">2241</FONT>                    def = newInstance(getZero());<a name="line.2241"></a>
<FONT color="green">2242</FONT>                    def.sign = result.sign;<a name="line.2242"></a>
<FONT color="green">2243</FONT>                    def.nans = QNAN;<a name="line.2243"></a>
<FONT color="green">2244</FONT>                    break;<a name="line.2244"></a>
<FONT color="green">2245</FONT>    <a name="line.2245"></a>
<FONT color="green">2246</FONT>                case DfpField.FLAG_DIV_ZERO:<a name="line.2246"></a>
<FONT color="green">2247</FONT>                    if (nans == FINITE &amp;&amp; mant[mant.length-1] != 0) {<a name="line.2247"></a>
<FONT color="green">2248</FONT>                        // normal case, we are finite, non-zero<a name="line.2248"></a>
<FONT color="green">2249</FONT>                        def = newInstance(getZero());<a name="line.2249"></a>
<FONT color="green">2250</FONT>                        def.sign = (byte)(sign*oper.sign);<a name="line.2250"></a>
<FONT color="green">2251</FONT>                        def.nans = INFINITE;<a name="line.2251"></a>
<FONT color="green">2252</FONT>                    }<a name="line.2252"></a>
<FONT color="green">2253</FONT>    <a name="line.2253"></a>
<FONT color="green">2254</FONT>                    if (nans == FINITE &amp;&amp; mant[mant.length-1] == 0) {<a name="line.2254"></a>
<FONT color="green">2255</FONT>                        //  0/0<a name="line.2255"></a>
<FONT color="green">2256</FONT>                        def = newInstance(getZero());<a name="line.2256"></a>
<FONT color="green">2257</FONT>                        def.nans = QNAN;<a name="line.2257"></a>
<FONT color="green">2258</FONT>                    }<a name="line.2258"></a>
<FONT color="green">2259</FONT>    <a name="line.2259"></a>
<FONT color="green">2260</FONT>                    if (nans == INFINITE || nans == QNAN) {<a name="line.2260"></a>
<FONT color="green">2261</FONT>                        def = newInstance(getZero());<a name="line.2261"></a>
<FONT color="green">2262</FONT>                        def.nans = QNAN;<a name="line.2262"></a>
<FONT color="green">2263</FONT>                    }<a name="line.2263"></a>
<FONT color="green">2264</FONT>    <a name="line.2264"></a>
<FONT color="green">2265</FONT>                    if (nans == INFINITE || nans == SNAN) {<a name="line.2265"></a>
<FONT color="green">2266</FONT>                        def = newInstance(getZero());<a name="line.2266"></a>
<FONT color="green">2267</FONT>                        def.nans = QNAN;<a name="line.2267"></a>
<FONT color="green">2268</FONT>                    }<a name="line.2268"></a>
<FONT color="green">2269</FONT>                    break;<a name="line.2269"></a>
<FONT color="green">2270</FONT>    <a name="line.2270"></a>
<FONT color="green">2271</FONT>                case DfpField.FLAG_UNDERFLOW:<a name="line.2271"></a>
<FONT color="green">2272</FONT>                    if ( (result.exp+mant.length) &lt; MIN_EXP) {<a name="line.2272"></a>
<FONT color="green">2273</FONT>                        def = newInstance(getZero());<a name="line.2273"></a>
<FONT color="green">2274</FONT>                        def.sign = result.sign;<a name="line.2274"></a>
<FONT color="green">2275</FONT>                    } else {<a name="line.2275"></a>
<FONT color="green">2276</FONT>                        def = newInstance(result);  // gradual underflow<a name="line.2276"></a>
<FONT color="green">2277</FONT>                    }<a name="line.2277"></a>
<FONT color="green">2278</FONT>                    result.exp = result.exp + ERR_SCALE;<a name="line.2278"></a>
<FONT color="green">2279</FONT>                    break;<a name="line.2279"></a>
<FONT color="green">2280</FONT>    <a name="line.2280"></a>
<FONT color="green">2281</FONT>                case DfpField.FLAG_OVERFLOW:<a name="line.2281"></a>
<FONT color="green">2282</FONT>                    result.exp = result.exp - ERR_SCALE;<a name="line.2282"></a>
<FONT color="green">2283</FONT>                    def = newInstance(getZero());<a name="line.2283"></a>
<FONT color="green">2284</FONT>                    def.sign = result.sign;<a name="line.2284"></a>
<FONT color="green">2285</FONT>                    def.nans = INFINITE;<a name="line.2285"></a>
<FONT color="green">2286</FONT>                    break;<a name="line.2286"></a>
<FONT color="green">2287</FONT>    <a name="line.2287"></a>
<FONT color="green">2288</FONT>                default: def = result; break;<a name="line.2288"></a>
<FONT color="green">2289</FONT>            }<a name="line.2289"></a>
<FONT color="green">2290</FONT>    <a name="line.2290"></a>
<FONT color="green">2291</FONT>            return trap(type, what, oper, def, result);<a name="line.2291"></a>
<FONT color="green">2292</FONT>    <a name="line.2292"></a>
<FONT color="green">2293</FONT>        }<a name="line.2293"></a>
<FONT color="green">2294</FONT>    <a name="line.2294"></a>
<FONT color="green">2295</FONT>        /** Trap handler.  Subclasses may override this to provide trap<a name="line.2295"></a>
<FONT color="green">2296</FONT>         *  functionality per IEEE 854-1987.<a name="line.2296"></a>
<FONT color="green">2297</FONT>         *<a name="line.2297"></a>
<FONT color="green">2298</FONT>         *  @param type  The exception type - e.g. FLAG_OVERFLOW<a name="line.2298"></a>
<FONT color="green">2299</FONT>         *  @param what  The name of the routine we were in e.g. divide()<a name="line.2299"></a>
<FONT color="green">2300</FONT>         *  @param oper  An operand to this function if any<a name="line.2300"></a>
<FONT color="green">2301</FONT>         *  @param def   The default return value if trap not enabled<a name="line.2301"></a>
<FONT color="green">2302</FONT>         *  @param result    The result that is specified to be delivered per<a name="line.2302"></a>
<FONT color="green">2303</FONT>         *                   IEEE 854, if any<a name="line.2303"></a>
<FONT color="green">2304</FONT>         *  @return the value that should be return by the operation triggering the trap<a name="line.2304"></a>
<FONT color="green">2305</FONT>         */<a name="line.2305"></a>
<FONT color="green">2306</FONT>        protected Dfp trap(int type, String what, Dfp oper, Dfp def, Dfp result) {<a name="line.2306"></a>
<FONT color="green">2307</FONT>            return def;<a name="line.2307"></a>
<FONT color="green">2308</FONT>        }<a name="line.2308"></a>
<FONT color="green">2309</FONT>    <a name="line.2309"></a>
<FONT color="green">2310</FONT>        /** Returns the type - one of FINITE, INFINITE, SNAN, QNAN.<a name="line.2310"></a>
<FONT color="green">2311</FONT>         * @return type of the number<a name="line.2311"></a>
<FONT color="green">2312</FONT>         */<a name="line.2312"></a>
<FONT color="green">2313</FONT>        public int classify() {<a name="line.2313"></a>
<FONT color="green">2314</FONT>            return nans;<a name="line.2314"></a>
<FONT color="green">2315</FONT>        }<a name="line.2315"></a>
<FONT color="green">2316</FONT>    <a name="line.2316"></a>
<FONT color="green">2317</FONT>        /** Creates an instance that is the same as x except that it has the sign of y.<a name="line.2317"></a>
<FONT color="green">2318</FONT>         * abs(x) = dfp.copysign(x, dfp.one)<a name="line.2318"></a>
<FONT color="green">2319</FONT>         * @param x number to get the value from<a name="line.2319"></a>
<FONT color="green">2320</FONT>         * @param y number to get the sign from<a name="line.2320"></a>
<FONT color="green">2321</FONT>         * @return a number with the value of x and the sign of y<a name="line.2321"></a>
<FONT color="green">2322</FONT>         */<a name="line.2322"></a>
<FONT color="green">2323</FONT>        public static Dfp copysign(final Dfp x, final Dfp y) {<a name="line.2323"></a>
<FONT color="green">2324</FONT>            Dfp result = x.newInstance(x);<a name="line.2324"></a>
<FONT color="green">2325</FONT>            result.sign = y.sign;<a name="line.2325"></a>
<FONT color="green">2326</FONT>            return result;<a name="line.2326"></a>
<FONT color="green">2327</FONT>        }<a name="line.2327"></a>
<FONT color="green">2328</FONT>    <a name="line.2328"></a>
<FONT color="green">2329</FONT>        /** Returns the next number greater than this one in the direction of x.<a name="line.2329"></a>
<FONT color="green">2330</FONT>         * If this==x then simply returns this.<a name="line.2330"></a>
<FONT color="green">2331</FONT>         * @param x direction where to look at<a name="line.2331"></a>
<FONT color="green">2332</FONT>         * @return closest number next to instance in the direction of x<a name="line.2332"></a>
<FONT color="green">2333</FONT>         */<a name="line.2333"></a>
<FONT color="green">2334</FONT>        public Dfp nextAfter(final Dfp x) {<a name="line.2334"></a>
<FONT color="green">2335</FONT>    <a name="line.2335"></a>
<FONT color="green">2336</FONT>            // make sure we don't mix number with different precision<a name="line.2336"></a>
<FONT color="green">2337</FONT>            if (field.getRadixDigits() != x.field.getRadixDigits()) {<a name="line.2337"></a>
<FONT color="green">2338</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INVALID);<a name="line.2338"></a>
<FONT color="green">2339</FONT>                final Dfp result = newInstance(getZero());<a name="line.2339"></a>
<FONT color="green">2340</FONT>                result.nans = QNAN;<a name="line.2340"></a>
<FONT color="green">2341</FONT>                return dotrap(DfpField.FLAG_INVALID, NEXT_AFTER_TRAP, x, result);<a name="line.2341"></a>
<FONT color="green">2342</FONT>            }<a name="line.2342"></a>
<FONT color="green">2343</FONT>    <a name="line.2343"></a>
<FONT color="green">2344</FONT>            // if this is greater than x<a name="line.2344"></a>
<FONT color="green">2345</FONT>            boolean up = false;<a name="line.2345"></a>
<FONT color="green">2346</FONT>            if (this.lessThan(x)) {<a name="line.2346"></a>
<FONT color="green">2347</FONT>                up = true;<a name="line.2347"></a>
<FONT color="green">2348</FONT>            }<a name="line.2348"></a>
<FONT color="green">2349</FONT>    <a name="line.2349"></a>
<FONT color="green">2350</FONT>            if (compare(this, x) == 0) {<a name="line.2350"></a>
<FONT color="green">2351</FONT>                return newInstance(x);<a name="line.2351"></a>
<FONT color="green">2352</FONT>            }<a name="line.2352"></a>
<FONT color="green">2353</FONT>    <a name="line.2353"></a>
<FONT color="green">2354</FONT>            if (lessThan(getZero())) {<a name="line.2354"></a>
<FONT color="green">2355</FONT>                up = !up;<a name="line.2355"></a>
<FONT color="green">2356</FONT>            }<a name="line.2356"></a>
<FONT color="green">2357</FONT>    <a name="line.2357"></a>
<FONT color="green">2358</FONT>            final Dfp inc;<a name="line.2358"></a>
<FONT color="green">2359</FONT>            Dfp result;<a name="line.2359"></a>
<FONT color="green">2360</FONT>            if (up) {<a name="line.2360"></a>
<FONT color="green">2361</FONT>                inc = newInstance(getOne());<a name="line.2361"></a>
<FONT color="green">2362</FONT>                inc.exp = this.exp-mant.length+1;<a name="line.2362"></a>
<FONT color="green">2363</FONT>                inc.sign = this.sign;<a name="line.2363"></a>
<FONT color="green">2364</FONT>    <a name="line.2364"></a>
<FONT color="green">2365</FONT>                if (this.equals(getZero())) {<a name="line.2365"></a>
<FONT color="green">2366</FONT>                    inc.exp = MIN_EXP-mant.length;<a name="line.2366"></a>
<FONT color="green">2367</FONT>                }<a name="line.2367"></a>
<FONT color="green">2368</FONT>    <a name="line.2368"></a>
<FONT color="green">2369</FONT>                result = add(inc);<a name="line.2369"></a>
<FONT color="green">2370</FONT>            } else {<a name="line.2370"></a>
<FONT color="green">2371</FONT>                inc = newInstance(getOne());<a name="line.2371"></a>
<FONT color="green">2372</FONT>                inc.exp = this.exp;<a name="line.2372"></a>
<FONT color="green">2373</FONT>                inc.sign = this.sign;<a name="line.2373"></a>
<FONT color="green">2374</FONT>    <a name="line.2374"></a>
<FONT color="green">2375</FONT>                if (this.equals(inc)) {<a name="line.2375"></a>
<FONT color="green">2376</FONT>                    inc.exp = this.exp-mant.length;<a name="line.2376"></a>
<FONT color="green">2377</FONT>                } else {<a name="line.2377"></a>
<FONT color="green">2378</FONT>                    inc.exp = this.exp-mant.length+1;<a name="line.2378"></a>
<FONT color="green">2379</FONT>                }<a name="line.2379"></a>
<FONT color="green">2380</FONT>    <a name="line.2380"></a>
<FONT color="green">2381</FONT>                if (this.equals(getZero())) {<a name="line.2381"></a>
<FONT color="green">2382</FONT>                    inc.exp = MIN_EXP-mant.length;<a name="line.2382"></a>
<FONT color="green">2383</FONT>                }<a name="line.2383"></a>
<FONT color="green">2384</FONT>    <a name="line.2384"></a>
<FONT color="green">2385</FONT>                result = this.subtract(inc);<a name="line.2385"></a>
<FONT color="green">2386</FONT>            }<a name="line.2386"></a>
<FONT color="green">2387</FONT>    <a name="line.2387"></a>
<FONT color="green">2388</FONT>            if (result.classify() == INFINITE &amp;&amp; this.classify() != INFINITE) {<a name="line.2388"></a>
<FONT color="green">2389</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INEXACT);<a name="line.2389"></a>
<FONT color="green">2390</FONT>                result = dotrap(DfpField.FLAG_INEXACT, NEXT_AFTER_TRAP, x, result);<a name="line.2390"></a>
<FONT color="green">2391</FONT>            }<a name="line.2391"></a>
<FONT color="green">2392</FONT>    <a name="line.2392"></a>
<FONT color="green">2393</FONT>            if (result.equals(getZero()) &amp;&amp; this.equals(getZero()) == false) {<a name="line.2393"></a>
<FONT color="green">2394</FONT>                field.setIEEEFlagsBits(DfpField.FLAG_INEXACT);<a name="line.2394"></a>
<FONT color="green">2395</FONT>                result = dotrap(DfpField.FLAG_INEXACT, NEXT_AFTER_TRAP, x, result);<a name="line.2395"></a>
<FONT color="green">2396</FONT>            }<a name="line.2396"></a>
<FONT color="green">2397</FONT>    <a name="line.2397"></a>
<FONT color="green">2398</FONT>            return result;<a name="line.2398"></a>
<FONT color="green">2399</FONT>    <a name="line.2399"></a>
<FONT color="green">2400</FONT>        }<a name="line.2400"></a>
<FONT color="green">2401</FONT>    <a name="line.2401"></a>
<FONT color="green">2402</FONT>        /** Convert the instance into a double.<a name="line.2402"></a>
<FONT color="green">2403</FONT>         * @return a double approximating the instance<a name="line.2403"></a>
<FONT color="green">2404</FONT>         * @see #toSplitDouble()<a name="line.2404"></a>
<FONT color="green">2405</FONT>         */<a name="line.2405"></a>
<FONT color="green">2406</FONT>        public double toDouble() {<a name="line.2406"></a>
<FONT color="green">2407</FONT>    <a name="line.2407"></a>
<FONT color="green">2408</FONT>            if (isInfinite()) {<a name="line.2408"></a>
<FONT color="green">2409</FONT>                if (lessThan(getZero())) {<a name="line.2409"></a>
<FONT color="green">2410</FONT>                    return Double.NEGATIVE_INFINITY;<a name="line.2410"></a>
<FONT color="green">2411</FONT>                } else {<a name="line.2411"></a>
<FONT color="green">2412</FONT>                    return Double.POSITIVE_INFINITY;<a name="line.2412"></a>
<FONT color="green">2413</FONT>                }<a name="line.2413"></a>
<FONT color="green">2414</FONT>            }<a name="line.2414"></a>
<FONT color="green">2415</FONT>    <a name="line.2415"></a>
<FONT color="green">2416</FONT>            if (isNaN()) {<a name="line.2416"></a>
<FONT color="green">2417</FONT>                return Double.NaN;<a name="line.2417"></a>
<FONT color="green">2418</FONT>            }<a name="line.2418"></a>
<FONT color="green">2419</FONT>    <a name="line.2419"></a>
<FONT color="green">2420</FONT>            Dfp y = this;<a name="line.2420"></a>
<FONT color="green">2421</FONT>            boolean negate = false;<a name="line.2421"></a>
<FONT color="green">2422</FONT>            int cmp0 = compare(this, getZero());<a name="line.2422"></a>
<FONT color="green">2423</FONT>            if (cmp0 == 0) {<a name="line.2423"></a>
<FONT color="green">2424</FONT>                return sign &lt; 0 ? -0.0 : +0.0;<a name="line.2424"></a>
<FONT color="green">2425</FONT>            } else if (cmp0 &lt; 0) {<a name="line.2425"></a>
<FONT color="green">2426</FONT>                y = negate();<a name="line.2426"></a>
<FONT color="green">2427</FONT>                negate = true;<a name="line.2427"></a>
<FONT color="green">2428</FONT>            }<a name="line.2428"></a>
<FONT color="green">2429</FONT>    <a name="line.2429"></a>
<FONT color="green">2430</FONT>            /* Find the exponent, first estimate by integer log10, then adjust.<a name="line.2430"></a>
<FONT color="green">2431</FONT>             Should be faster than doing a natural logarithm.  */<a name="line.2431"></a>
<FONT color="green">2432</FONT>            int exponent = (int)(y.log10() * 3.32);<a name="line.2432"></a>
<FONT color="green">2433</FONT>            if (exponent &lt; 0) {<a name="line.2433"></a>
<FONT color="green">2434</FONT>                exponent--;<a name="line.2434"></a>
<FONT color="green">2435</FONT>            }<a name="line.2435"></a>
<FONT color="green">2436</FONT>    <a name="line.2436"></a>
<FONT color="green">2437</FONT>            Dfp tempDfp = DfpMath.pow(getTwo(), exponent);<a name="line.2437"></a>
<FONT color="green">2438</FONT>            while (tempDfp.lessThan(y) || tempDfp.equals(y)) {<a name="line.2438"></a>
<FONT color="green">2439</FONT>                tempDfp = tempDfp.multiply(2);<a name="line.2439"></a>
<FONT color="green">2440</FONT>                exponent++;<a name="line.2440"></a>
<FONT color="green">2441</FONT>            }<a name="line.2441"></a>
<FONT color="green">2442</FONT>            exponent--;<a name="line.2442"></a>
<FONT color="green">2443</FONT>    <a name="line.2443"></a>
<FONT color="green">2444</FONT>            /* We have the exponent, now work on the mantissa */<a name="line.2444"></a>
<FONT color="green">2445</FONT>    <a name="line.2445"></a>
<FONT color="green">2446</FONT>            y = y.divide(DfpMath.pow(getTwo(), exponent));<a name="line.2446"></a>
<FONT color="green">2447</FONT>            if (exponent &gt; -1023) {<a name="line.2447"></a>
<FONT color="green">2448</FONT>                y = y.subtract(getOne());<a name="line.2448"></a>
<FONT color="green">2449</FONT>            }<a name="line.2449"></a>
<FONT color="green">2450</FONT>    <a name="line.2450"></a>
<FONT color="green">2451</FONT>            if (exponent &lt; -1074) {<a name="line.2451"></a>
<FONT color="green">2452</FONT>                return 0;<a name="line.2452"></a>
<FONT color="green">2453</FONT>            }<a name="line.2453"></a>
<FONT color="green">2454</FONT>    <a name="line.2454"></a>
<FONT color="green">2455</FONT>            if (exponent &gt; 1023) {<a name="line.2455"></a>
<FONT color="green">2456</FONT>                return negate ? Double.NEGATIVE_INFINITY : Double.POSITIVE_INFINITY;<a name="line.2456"></a>
<FONT color="green">2457</FONT>            }<a name="line.2457"></a>
<FONT color="green">2458</FONT>    <a name="line.2458"></a>
<FONT color="green">2459</FONT>    <a name="line.2459"></a>
<FONT color="green">2460</FONT>            y = y.multiply(newInstance(4503599627370496l)).rint();<a name="line.2460"></a>
<FONT color="green">2461</FONT>            String str = y.toString();<a name="line.2461"></a>
<FONT color="green">2462</FONT>            str = str.substring(0, str.length()-1);<a name="line.2462"></a>
<FONT color="green">2463</FONT>            long mantissa = Long.parseLong(str);<a name="line.2463"></a>
<FONT color="green">2464</FONT>    <a name="line.2464"></a>
<FONT color="green">2465</FONT>            if (mantissa == 4503599627370496L) {<a name="line.2465"></a>
<FONT color="green">2466</FONT>                // Handle special case where we round up to next power of two<a name="line.2466"></a>
<FONT color="green">2467</FONT>                mantissa = 0;<a name="line.2467"></a>
<FONT color="green">2468</FONT>                exponent++;<a name="line.2468"></a>
<FONT color="green">2469</FONT>            }<a name="line.2469"></a>
<FONT color="green">2470</FONT>    <a name="line.2470"></a>
<FONT color="green">2471</FONT>            /* Its going to be subnormal, so make adjustments */<a name="line.2471"></a>
<FONT color="green">2472</FONT>            if (exponent &lt;= -1023) {<a name="line.2472"></a>
<FONT color="green">2473</FONT>                exponent--;<a name="line.2473"></a>
<FONT color="green">2474</FONT>            }<a name="line.2474"></a>
<FONT color="green">2475</FONT>    <a name="line.2475"></a>
<FONT color="green">2476</FONT>            while (exponent &lt; -1023) {<a name="line.2476"></a>
<FONT color="green">2477</FONT>                exponent++;<a name="line.2477"></a>
<FONT color="green">2478</FONT>                mantissa &gt;&gt;&gt;= 1;<a name="line.2478"></a>
<FONT color="green">2479</FONT>            }<a name="line.2479"></a>
<FONT color="green">2480</FONT>    <a name="line.2480"></a>
<FONT color="green">2481</FONT>            long bits = mantissa | ((exponent + 1023L) &lt;&lt; 52);<a name="line.2481"></a>
<FONT color="green">2482</FONT>            double x = Double.longBitsToDouble(bits);<a name="line.2482"></a>
<FONT color="green">2483</FONT>    <a name="line.2483"></a>
<FONT color="green">2484</FONT>            if (negate) {<a name="line.2484"></a>
<FONT color="green">2485</FONT>                x = -x;<a name="line.2485"></a>
<FONT color="green">2486</FONT>            }<a name="line.2486"></a>
<FONT color="green">2487</FONT>    <a name="line.2487"></a>
<FONT color="green">2488</FONT>            return x;<a name="line.2488"></a>
<FONT color="green">2489</FONT>    <a name="line.2489"></a>
<FONT color="green">2490</FONT>        }<a name="line.2490"></a>
<FONT color="green">2491</FONT>    <a name="line.2491"></a>
<FONT color="green">2492</FONT>        /** Convert the instance into a split double.<a name="line.2492"></a>
<FONT color="green">2493</FONT>         * @return an array of two doubles which sum represent the instance<a name="line.2493"></a>
<FONT color="green">2494</FONT>         * @see #toDouble()<a name="line.2494"></a>
<FONT color="green">2495</FONT>         */<a name="line.2495"></a>
<FONT color="green">2496</FONT>        public double[] toSplitDouble() {<a name="line.2496"></a>
<FONT color="green">2497</FONT>            double split[] = new double[2];<a name="line.2497"></a>
<FONT color="green">2498</FONT>            long mask = 0xffffffffc0000000L;<a name="line.2498"></a>
<FONT color="green">2499</FONT>    <a name="line.2499"></a>
<FONT color="green">2500</FONT>            split[0] = Double.longBitsToDouble(Double.doubleToLongBits(toDouble()) &amp; mask);<a name="line.2500"></a>
<FONT color="green">2501</FONT>            split[1] = subtract(newInstance(split[0])).toDouble();<a name="line.2501"></a>
<FONT color="green">2502</FONT>    <a name="line.2502"></a>
<FONT color="green">2503</FONT>            return split;<a name="line.2503"></a>
<FONT color="green">2504</FONT>        }<a name="line.2504"></a>
<FONT color="green">2505</FONT>    <a name="line.2505"></a>
<FONT color="green">2506</FONT>    }<a name="line.2506"></a>




























































</PRE>
</BODY>
</HTML>
